What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Algorithm
Stephen T. Hedetniemi mainly focuses on Discrete mathematics, Combinatorics, Domination analysis, Dominating set and Graph.
In his work, Graph and Steiner tree problem is strongly intertwined with Algorithm, which is a subfield of Discrete mathematics.
His biological study spans a wide range of topics, including Tree and Linear algorithm.
Stephen T. Hedetniemi usually deals with Dominating set and limits it to topics linked to Neighbourhood and Distance-regular graph, Bound graph, Circulant graph and Line graph.
His research in the fields of Connectivity overlaps with other disciplines such as Upper and lower bounds.
His studies in Bidimensionality integrate themes in fields like Multiset, Dual polyhedron and Vizing's conjecture.
His most cited work include:
- Fundamentals of domination in graphs (2278 citations)
- A survey of gossiping and broadcasting in communication networks (1098 citations)
- Domination in graphs : advanced topics (959 citations)
What are the main themes of his work throughout his whole career to date?
Stephen T. Hedetniemi spends much of his time researching Combinatorics, Discrete mathematics, Graph, Dominating set and Domination analysis.
His study in Vertex, Vertex, Chordal graph, Indifference graph and Independent set falls within the category of Combinatorics.
His Indifference graph research is multidisciplinary, incorporating elements of Cograph, Pathwidth and Split graph.
His Discrete mathematics study incorporates themes from Algorithm and Graph theory.
The Connectivity research he does as part of his general Graph study is frequently linked to other disciplines of science, such as Upper and lower bounds, therefore creating a link between diverse domains of science.
Domatic number and Bidimensionality are among the areas of Dominating set where Stephen T. Hedetniemi concentrates his study.
He most often published in these fields:
- Combinatorics (72.86%)
- Discrete mathematics (58.79%)
- Graph (36.68%)
What were the highlights of his more recent work (between 2011-2021)?
- Combinatorics (72.86%)
- Graph (36.68%)
- Vertex (18.59%)
In recent papers he was focusing on the following fields of study:
The scientist’s investigation covers issues in Combinatorics, Graph, Vertex, Domination analysis and Discrete mathematics.
His study in the field of Bipartite graph and Independent set also crosses realms of Upper and lower bounds and Laplace operator.
His Vertex research incorporates elements of Bound graph and Cartesian product.
His Domination analysis research includes themes of Lattice graph and Independence number.
As part of his studies on Discrete mathematics, Stephen T. Hedetniemi frequently links adjacent subjects like Algorithm.
His Dominating set research is multidisciplinary, relying on both Maximum cut and Minimum cut.
Between 2011 and 2021, his most popular works were:
- Roman { 2 } -domination (74 citations)
- Double Roman domination (67 citations)
- [1, 2]-sets in graphs (34 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algorithm
- Discrete mathematics
Stephen T. Hedetniemi focuses on Combinatorics, Graph, Domination analysis, Discrete mathematics and Vertex.
He applies his multidisciplinary studies on Combinatorics and Rainbow in his research.
Stephen T. Hedetniemi combines subjects such as Lattice graph, Independence number and Bipartite graph with his study of Domination analysis.
Other disciplines of study, such as Volume, Eigenvalue distribution, Laplace operator and Vertex angle, are mixed together with his Discrete mathematics studies.
His Vertex research is multidisciplinary, incorporating perspectives in Time complexity, Algorithm and Neighbourhood.
His work deals with themes such as Saturation, Edge cover, Bound graph and Degree, which intersect with Neighbourhood.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
