A note on split domination number of a graph
T. Tamizh Chelvam, S. Robinson Chellathurai · Journal of Discrete Mathematical Sciences and Cryptography · 2009
A dominating set D of a graph G is a split dominating set if the induced subgraph is disconnected. The split domination number γ s (G) is the minimum cardinality of a split dominating set. The concept of split domination number was introduced by Kulli and Janakiram. In this paper, some results on split domination are obtained.