• DOMINATION PARAMETERS OF SOME GRAPHS AND ITS REALIZATION
Abstract
The domination parameters of a graph G of order n has been already introduced in [9]. It is defined as DÍV(G) is a dominating set of G, if every vertex vÎ V-D is adjacent to atleast one vertex in D. In this paper we established various domination parameters of some graphs such as path, cycle, wheel, star, r-corona and complete bipartite graph with m, n vertices. Also established the relation between this parameters and illustrated an example for some graphs which is deviated from its general formula.
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |