42 citations · 152 across the 58 of their papers we have counts for
6 papers · 2 filters
On accurate domination in graphs
Joanna Cyman, Michael A. Henning, Jerzy Topp
A dominating set of a graph is a subset such that every vertex not in is adjacent to at least one vertex in . The cardinality of a smallest dominating…
Game Total Domination Critical Graphs
Michael A. Henning, Sandi Klavžar, Douglas F. Rall
In the total domination game played on a graph , players Dominator and Staller alternately select vertices of , as long as possible, such that each vertex chosen increases th…
Total Forcing and Zero Forcing in Claw-Free Cubic Graphs
Randy Davila, Michael Henning
A dynamic coloring of the vertices of a graph starts with an initial subset of colored vertices, with all remaining vertices being non-colored. At each discrete time interv…
Equating Maximum Degrees in Graphs without Short Cycles
M. Fürst, M. Gentner, M. A. Henning +2
For an integer at least , and a graph , let be the minimum cardinality of a set of vertices of such that has either vertices of maximum degree…
On the Total Forcing Number of a Graph
Randy Davila, Michael A. Henning
Let be a simple and finite graph without isolated vertices. In this paper we study forcing sets (zero forcing sets) which induce a subgraph of without isolated vertices. Su…
Total Forcing Sets in Trees
Randy Davila, Michael Henning
A dynamic coloring of the vertices of a graph starts with an initial subset of colored vertices, with all remaining vertices being non-colored. At each discrete time interv…