Jiang, H.; Wu, P.; Shao, Z.; Rao, Y.; Liu, J.-B. The Double Roman Domination Numbers of Generalized Petersen Graphs P(n, 2). Mathematics 2018, 6, 206, doi:10.3390/math6100206.
Jiang, H.; Wu, P.; Shao, Z.; Rao, Y.; Liu, J.-B. The Double Roman Domination Numbers of Generalized Petersen Graphs P(n, 2). Mathematics 2018, 6, 206, doi:10.3390/math6100206.
Jiang, H.; Wu, P.; Shao, Z.; Rao, Y.; Liu, J.-B. The Double Roman Domination Numbers of Generalized Petersen Graphs P(n, 2). Mathematics 2018, 6, 206, doi:10.3390/math6100206.
Jiang, H.; Wu, P.; Shao, Z.; Rao, Y.; Liu, J.-B. The Double Roman Domination Numbers of Generalized Petersen Graphs P(n, 2). Mathematics 2018, 6, 206, doi:10.3390/math6100206.
Abstract
A double Roman dominating function on a graph G is a function f : V(G) → {0, 1, 2, 3} 2 with the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for 3 which f(v) = 3 or two vertices v1 and v2 for which f(v1) = f(v2) = 2, and every vertex u for which 4 f(u) = 1 is adjacent to at least one vertex v for which f(v) ≥ 2. The weight of a double Roman dominating function f is the value w(f) = ∑u∈V(G) 5 f(u). The minimum weight over all double 6 Roman dominating functions on a graph G is called the double Roman domination number γdR(G) 7 of G. In this paper we determine the exact value of the double Roman domination number of the 8 generalized Petersen graphs P(n, 2) by using a discharging approach.
Keywords
double Roman domination; discharging approach; generalized Petersen graphs
Subject
Computer Science and Mathematics, Computer Vision and Graphics
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.