On the Independent Domination Number of Regular Graphs
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. In this paper, we consider questions about independent domination in regular graphs.
Annals of Combinatorics
Henning, M. A.,
(2012). On the Independent Domination Number of Regular Graphs. Annals of Combinatorics, 16(4), 719-2139.
Available at: https://aquila.usm.edu/fac_pubs/7574