Zenodo.org will be unavailable for 2 hours on September 29th from 06:00-08:00 UTC. See announcement.

Journal article Open Access

Double Domination Number of Some Families of Graph

Manjula. C. Gudgeri; Varsha

Blue Eyes Intelligence Engineering and Sciences Publication(BEIESP)

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.

Files (964.5 kB)
Name Size
964.5 kB Download
Views 43
Downloads 32
Data volume 30.9 MB
Unique views 34
Unique downloads 31


Cite as