• DOMINATION AND TOTAL DOMIANTION OF SPLITTED GRAPHS

A. Nellai Murugan*, A. Esakkimuthu

Abstract


A set D of vertices in a splitted graph S(G)=(V, E) is called a dominating set if every vertex in V-D is adjacent to some vertex in D. The domination number γ [S(G)] of S(G) is minimum cardinality of a domination set of S(G) and A set D V is a total domination set of splitted graph S(G) if every vertex in V is adjacent to some vertex in D. The total domination number [S (G)] of S(G) is minimum cardinality of a domination set of S(G).


Keywords


Domination, Total Domination, Splitted graph.

Full Text:

pdf


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