The non - split majority dominating set of a graph

  • Joseline Manoraa, S. Veeramanikandan, Joseline Manora
  • Published 2015

Abstract

A majority dominating set D of a graph G = (V,E) is non split majority dominating set if the induced sub graph 〈V −D〉 is connected. In this paper, we study the non split majority dominating set of a graph G and its number γNSM (G). Also some bounds of γNSM (G) and the relationship of γNSM (G)with other domination parameters of G are obtained.

Cite this paper

@inproceedings{Manoraa2015TheN, title={The non - split majority dominating set of a graph}, author={Joseline Manoraa and S. Veeramanikandan and Joseline Manora}, year={2015} }