- Home
- Best Scientists - Mathematics
- Michael A. Henning

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
48
Citations
10,536
380
World Ranking
3202
National Ranking
2

Mathematics
D-index
48
Citations
10,487
380
World Ranking
655
National Ranking
2

- Combinatorics
- Discrete mathematics
- Graph theory

Michael A. Henning mainly investigates Combinatorics, Discrete mathematics, Domination analysis, Dominating set and Graph. His study ties his expertise on Upper and lower bounds together with the subject of Combinatorics. His work in Vertex, Neighbourhood, Bound graph, Vertex and Bipartite graph is related to Discrete mathematics.

His biological study spans a wide range of topics, including Graph theory, Planar graph, Cartesian product and Conjecture. His research in Dominating set intersects with topics in Characterization and Connectivity. His Graph research incorporates themes from Minimum weight and Graph theoretic.

- Domination in Graphs Applied to Electric Power Networks (242 citations)
- A survey of selected recent results on total domination in graphs (214 citations)
- Domination in graphs (191 citations)

His primary areas of study are Combinatorics, Discrete mathematics, Graph, Domination analysis and Vertex. Dominating set, Connectivity, Neighbourhood, Bound graph and Conjecture are the subjects of his Combinatorics studies. His Discrete mathematics study frequently links to related topics such as Upper and lower bounds.

His Graph research includes themes of Disjoint sets, Graph theory and Degree. His research integrates issues of Minimum weight, Regular graph and Cartesian product in his study of Domination analysis. His Vertex research is multidisciplinary, incorporating elements of Hypergraph, Cardinality, Cubic graph and Dominator.

- Combinatorics (93.57%)
- Discrete mathematics (56.52%)
- Graph (49.53%)

- Combinatorics (93.57%)
- Graph (49.53%)
- Domination analysis (48.77%)

The scientist’s investigation covers issues in Combinatorics, Graph, Domination analysis, Vertex and Dominating set. In his study, which falls under the umbrella issue of Combinatorics, Order is strongly linked to Cardinality. His Graph research entails a greater understanding of Discrete mathematics.

Michael A. Henning has researched Domination analysis in several fields, including Approximation algorithm, Graph theory, Regular graph, Vertex and Minimum weight. His work on Induced subgraph as part of general Vertex study is frequently connected to Colored, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them. His work in Dominating set tackles topics such as Independent set which are related to areas like Complete bipartite graph.

- Algorithmic aspects of semitotal domination in graphs (16 citations)
- Perfect Italian domination in trees (13 citations)
- Maker–Breaker total domination game (8 citations)

- Combinatorics
- Graph theory
- Graph

His scientific interests lie mostly in Combinatorics, Graph, Domination analysis, Vertex and Dominating set. Combinatorics connects with themes related to Upper and lower bounds in his study. His Domination analysis study necessitates a more in-depth grasp of Discrete mathematics.

His work on Regular graph as part of general Discrete mathematics study is frequently linked to Weighting, bridging the gap between disciplines. His studies deal with areas such as Connected dominating set, Cubic graph and Hamiltonian path as well as Vertex. His Dominating set research is multidisciplinary, incorporating elements of Disjoint sets, Independent set and Outerplanar graph.

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.

Domination in graphs

Teresa W. Haynes;Michael A. Henning.

**(1998)**

1605 Citations

Total Domination in Graphs

Michael A. Henning;Anders Yeo.

**(2013)**

389 Citations

Domination in Graphs Applied to Electric Power Networks

Teresa W. Haynes;Sandra M. Hedetniemi;Stephen T. Hedetniemi;Michael A. Henning.

SIAM Journal on Discrete Mathematics **(2002)**

335 Citations

A survey of selected recent results on total domination in graphs

Michael A. Henning.

Discrete Mathematics **(2009)**

298 Citations

Minus domination in regular graphs

Jean Dunbar;Stephen Hedetniemi;Michael A. Henning;Alice A. McRae.

Discrete Mathematics **(1996)**

201 Citations

Defending the Roman Empire-A new strategy

Michael A. Henning;Stephen T. Hedetniemi.

Discrete Mathematics **(2003)**

193 Citations

RAINBOW DOMINATION IN GRAPHS

Boˇstjan Breˇsar;Michael A. Henning;Douglas F. Rall.

Taiwanese Journal of Mathematics **(2008)**

188 Citations

Independent domination in graphs: A survey and recent results

Wayne Goddard;Michael A. Henning.

Discrete Mathematics **(2013)**

179 Citations

Vizing's conjecture: a survey and recent results

Boštjan Brešar;Paul Dorbec;Wayne Goddard;Bert L. Hartnell.

Journal of Graph Theory **(2012)**

146 Citations

Graphs with large total domination number

Michael A. Henning.

Journal of Graph Theory **(2000)**

132 Citations

Discussiones Mathematicae - Graph Theory

(Impact Factor: 1.028)

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

University of Johannesburg

University of Ljubljana

Western Michigan University

Clemson University

University of Pannonia

Something went wrong. Please try again later.