More on Perfect Roman Domination in Graphs
2020 ◽
Vol 13
(3)
◽
pp. 529-548
Keyword(s):
A perfect Roman dominating function on a graph G = (V (G), E(G)) is a function f : V (G) → {0, 1, 2} for which each u ∈ V (G) with f(u) = 0 is adjacent to exactly one vertex v ∈ V (G) with f(v) = 2. The weight of a perfect Roman dominating function f is the value ωG(f) = Pv∈V (G) f(v). The perfect Roman domination number of G is the minimum weight of a perfect Roman dominating function on G. In this paper, we study the perfect Roman domination numbers of graphs under some binary operation
2020 ◽
Vol 12
(02)
◽
pp. 2050020
2018 ◽
Vol 11
(03)
◽
pp. 1850034
◽
2016 ◽
Vol 10
(1)
◽
pp. 65-72
◽
2018 ◽
2016 ◽
Vol 47
(3)
◽
pp. 357-371
◽
2021 ◽
pp. 556-562
2016 ◽
Vol 13
(10)
◽
pp. 7362-7365