Neighborhood outer split domination in graphs
K. Suriya Prabha, S. Amutha, Neelamegam Anbazhagan, S. Sankara Gomathi · Journal of Discrete Mathematical Sciences and Cryptography · 2019
A neighborhood outer split dominating set (nosd-set) in a graph G is a dominating set S with the property that the sub graph induced by the open neighborhood of the set S is disconnected. The minimum cardinality of vertices in such a set is called the neighborhood outer split domination number of G and it is denoted by γnos. In this paper, we initiate a study of this parameter.