The non - split majority dominating set of a graph

J. Joseline Manoraa,* and S. Veeramanikandanb

The non - split majority dominating set of a graph

Authors :

J. Joseline Manora^a,* and S. Veeramanikandan^b

Author Address :

^a,bPG and Research Department of Mathematics, T.B.M.L College, Porayar-609 307, Tamil Nadu, India.

*Corresponding author.

Abstract :

A majority dominating set D of a graph $G = ( V, E )$ is non - split majority dominating set if the induced sub graph $\langle V - D \rangle$ is connected. In this paper, we study the non - split majority dominating set of a graph $G$ and its number $\gamma _{_{NSM}}(G)$. Also some bounds of $\gamma_{_{NSM}} (G)$ and the relationship of $\gamma_{_{NSM}} (G)$ with other domination parameters of $G$ are obtained.

Keywords :

Majority Dominating Set, Non - Split Majority Dominating Set.

DOI :

Article Info :

Received : May 08, 2015; Accepted : June 19, 2015.