Roman domination in Cartesian product graphs and strong product graphs
2013 ◽
Vol 7
(2)
◽
pp. 262-274
◽
Keyword(s):
A map f : V ? {0, 1, 2} is a Roman dominating function for G if for every vertex v with f(v) = 0, there exists a vertex u, adjacent to v, with f(u) = 2. The weight of a Roman dominating function is f(V ) = ?u?v f(u). The minimum weight of a Roman dominating function on G is the Roman domination number of G. In this article we study the Roman domination number of Cartesian product graphs and strong product graphs.
2020 ◽
Vol 12
(02)
◽
pp. 2050020
2018 ◽
Vol 11
(03)
◽
pp. 1850034
◽
2015 ◽
Vol 07
(04)
◽
pp. 1550048
◽
2018 ◽
Vol 12
(1)
◽
pp. 143-152
◽
2019 ◽
Vol 13
(08)
◽
pp. 2050140