Abstract
Domination and 2-domination numbers are defined only for graphs with non-isolated vertices. In a Graph G = (V, E) each vertex is said to dominate every vertex in its closed neighborhood. In a graph G, a subset S of V(G) is called a 2-dominating set of G if every vertex in v ∈ V, is in V-S and has atleast two neighbors in S. The smallest cardinality of a 2-dominating set of G is known as the 2-domination number γ2(G). In this paper, we find 2-dominating set of some special graphs and also find the 2-domination number of graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
