• INTERSECTION GRAPHS ON MINIMAL MAJORITY DOMINATING SETS OF A GRAPH

S. VEERAMANIKANDAN*, J. JOSELINE MANORA

Abstract


Let G = (V, E) be a graph. The Minimal Majority Dominating Graph MMD(G) of a graph G is the intersection graph defined on the family of all minimal majority dominating sets of vertices in G. The Common Minimal Majority Dominating Graph CMMD(G) of a graph G is the graph having same vertex set as G with two vertices adjacent in CMMD(G) if and only if there exists a minimal majority dominating set in G containing them.                      

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
© 2010-2016 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter