Majority domination vertex critical graphs
Journal: International Journal of Mathematics and Soft Computing (Vol.3, No. 1)Publication Date: 2013-01-14
Authors : J. Joseline Manora V. Swaminathan;
Page : 47-51
Keywords : Majority Dominating Set; $\gamma_M$-critical vertex and graphs.;
Abstract
This paper deals the graphs for which the removal of any vertex changes the majority domination number of the graph. In the following section, how the removal of a single vertex from $G$ can change the majority domination number is surveyed for trees. Characterisation of $V^+_M(G)$ ~and~ $V^-_M(G)$ are determined.
Other Latest Articles
Last modified: 2013-08-24 11:46:37