Double Domination Number of Some Families of Graph
Contributors
- 1. Publisher
Description
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
B3307079220.pdf
Files
(964.5 kB)
Name | Size | Download all |
---|---|---|
md5:55effd1c6ff2a1243e234179752a7057
|
964.5 kB | Preview Download |
Additional details
Related works
- Is cited by
- Journal article: 2277-3878 (ISSN)
Subjects
- ISSN
- 2277-3878
- Retrieval Number
- B3307079220/2020©BEIESP