Nonsplit domsaturation number of a graph
Y. Therese Sunitha Mary, R. Kala · IOSR Journal of Mathematics · 2014
The nonsplit domsaturation number of a graph G , ) (G ds ns is the least positive integer k such that every vertex of G lies in a nonsplit dominating set of cardinality k .In this paper, we obtain certain bounds for ) (G ds ns and characterize the graphs which attain these bounds.