A Note on Disjoint Dominating Sets in Graphs
Veera Anusuya V · 2012
The disjoint domination number (G) of a graph G is the minimum cardinality of the union of two disjoint dominating sets in G. The disjoint independent domination number of a graph G is the minimum cardinality of the union of two disjoint independent dominating sets in G. In this paper we study these two parameters. We determine the value of (G) for several graphs and give partial answers to some open problems posed in [5].