Double Domination Number of Some Families of Graph - Blue Eyes Intelligence Engineering and Sciences Publication(BEIESP); Varsha; Manjula. C. Gudgeri (Zenodo, 2020)
In a graph G = (V, E) each vertex is said to dominate every vertex in its closed neighborhood. In a graph G, if S is a subset of V then S is a double dominating set of G if every vertex in V is dominated by at least two vertices in S. The smallest cardinality of a double dominating set is called the double domination number γx2 (G). [4]. In this paper, we computed some relations between double domination number, domination number, number of vertices (n) and maximum degree (∆) of Helm graph, Friendship graph, Ladder graph, Circular Ladder graph, Barbell graph, Gear graph and Firecracker graph.
Keywords: cc-by-4.0; dominating set, domination number, double dominating set, double domination number. We denote n, ∆ respectively by number of vertices, maximum degree of a graph G