42 citations · 152 across the 58 of their papers we have counts for
80 papers
On irredundance coloring and irredundance compelling coloring of graphs
David Ashok Kalarkop, Pawaton Kaemawichanurat
Irredundance coloring of is a proper coloring in which there exists a maximal irredundant set such that all the vertices of have different colors. The minimum number of…
Indicated total domination game
Michael A. Henning, Douglas F. Rall
A vertex in a graph totally dominates a vertex if is adjacent to in . A total dominating set of is a set of vertices of such that every vertex of…
The Sierpiński Domination Number
Michael A. Henning, Sandi Klavžar, Elżbieta Kleszcz +1
Let and be graphs and let be a function. The Sierpiński product of and with respect to , denoted by , is defined…
Resolvability and convexity properties in the Sierpiński product of graphs
Michael A. Henning, Sandi Klavžar, Ismael G. Yero
Let and be graphs and let be a function. The Sierpiński product of and with respect to , denoted by , is defined…
-Neighbor bootstrap percolation on grids
Jaka Hedžet, Michael A. Henning
Given a graph and assuming that some vertices of are infected, the -neighbor bootstrap percolation rule makes an uninfected vertex infected if has at least i…
The minmin coalition number in graphs
Davood Bakhshesh, Michael A. Henning
A set of vertices in a graph is a dominating set if every vertex of is adjacent to a vertex in . A coalition in consists of two disjoint sets of v…