A set S of vertices in a graph G is called an independent dominating set if S is both independent and dominating. The independent domination number of G is the minimum cardinality of an independent dominating set in G . In this paper, we investigate the exact value of independent domination number for some wheel related graphs.
Vaidya, S. K. and Pandit, R. M.
Independent Domination in Some Wheel Related Graphs,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 11,
1, Article 27.
Available at: https://digitalcommons.pvamu.edu/aam/vol11/iss1/27