Results on majority domatic number of a graph
J. Joseline Manora, V. Swaminathan, I. Paulraj Jayasimman · IEEE-International Conference On Advances In Engineering, Science And Management · 2012
This article deals with partitioning the vertex set V(G) into as many disjoint subsets, each being a majority dominating set with a required property. The majority domatic number d M (G) are found for some standard graphs. Some bounds and characterisations on d M (G) of a graph G are determined.