A Note on Nonsplitdomination number of a graph
Y. Therese Sunitha Mary, R. Kala · IOSR Journal of Mathematics · 2017
Let G = (V, E) be any graph.A dominating set D of a graph G is a nonsplit dominat-ing if is connected. The minimum cardinality of a nonsplit dominating set is called nonsplit domination number γ ns (G).In this paper, we investigate several properties of this parameter.