On Disconnected Domination Number of a Graph
S. Balamurugan, Gunasekaran Prabakaran · International Journal of Mathematics and Soft Computing · 2013
A dominating set D of graph G = (V, E) is a disconnected dominating set, if the induced subgraph is disconnected. The disconnected dominating number (G) of G is the minimum cardinality of a disconnected dominating set of G. In this paper, we relate this parameter to other parameters of graph G and obtain some bounds also. dc ? and obtain some bounds also.