42 citations · 152 across the 58 of their papers we have counts for
8 papers · 2 filters
Progress Towards the Total Domination Game -Conjecture
Michael A. Henning, Douglas F. Rall
In this paper, we continue the study of the total domination game in graphs introduced in [Graphs Combin. 31(5) (2015), 1453--1462], where the players Dominator and Staller alterna…
Lower Bounds on the Distance Domination Number of a Graph
Randy Davila, Caleb Fast, Michael Henning +1
For an integer , a (distance) -dominating set of a connected graph is a set of vertices of such that every vertex of is at distance at mo…
Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence
Michael Gentner, Michael A. Henning, Dieter Rautenbach
For a sequence of non-negative integers, let be the set of all forests whose degree sequence is . We present closed formulas for $γ_{\max}^{\cal F}(d)=\max\{ γ…
Smallest Domination Number and Largest Independence Number of Graphs and Forests with given Degree Sequence
Michael Gentner, Michael A. Henning, Dieter Rautenbach
For a sequence of non-negative integers, let and be the sets of all graphs and forests with degree sequence , respectively. Let $γ_{\min}(d)=\min…
Location-domination in line graphs
Florent Foucaud, Michael A. Henning
A set of vertices of a graph is locating if every two distinct vertices outside have distinct neighbors in ; that is, for distinct vertices and outside ,…
Transversals in -Uniform Hypergraphs
Michael A. Henning, Anders Yeo
Let be a -regular -uniform hypergraph on vertices. The transversal number of is the minimum number of vertices that intersect every edge. Lai and Chang [J.…