• INVERSE DOMINATION NUMBER OF ONE VERTEX UNION OF CYCLES, COMPLETE BIPARTITE GRAPH AND ONE EDGE UNION OF CYCLES

M. KARTHIKEYAN*, A. ELUMALAI

Abstract


Let G = (V, E) be a graph. Let D be a minimum dominating set in a graph G. If V-D Contains a dominating set D’ of G, then D’ is called an inverse dominating set with respect to D. The minimum cardinality of an inverse dominating set of a graph G is called the inverse domination number of G. In this paper we study the inverse domination number of one vertex union of cycles, complete bipartite graph and one edge union of cycles.


Keywords


Graph, Domination, Inverse domination number.

Full Text:

PDF


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