6 citations · 11 across the 23 of their papers we have counts for
22 papers · 1 filter
Total isolation game in graphs
Michael A. Henning, Douglas F. Rall
The total isolation game is played on a graph by two players who take turns playing a vertex such that if is the set of already played vertices, then a vertex can be select…
On -coalition in graphs: bounds and exact values
Boštjan Brešar, Michael A. Henning, Babak Samadi
Given a graph $G=\big{(}V(G),E(G)\big{)}$, a set is called a -dominating set if every vertex in has at least neighbors in . Two disjoi…
Paired domination in graphs with minimum degree four
Csilla Bujtás, Michael A. Henning
A set of vertices in a graph is a paired dominating set if every vertex of is adjacent to a vertex in and the subgraph induced by admits a perfect matching. The…
Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning
An identifying open code of a graph is a set of vertices that is both a separating open code (that is, for all distinct vertices and $…
Power Domination and Resolving Power Domination of Fractal Cubic Network
S. Prabhu, A. K. Arulmozhi, Michael A. Henning +1
In network theory, the domination parameter is vital in investigating several structural features of the networks, including connectedness, their tendency to form clusters, compact…
On total domination subdivision numbers of trees
Michael A. Henning, Jerzy Topp
A set of vertices in a graph is a total dominating set of if every vertex is adjacent to a vertex in . The total domination number is the minimum cardinalit…