Double Roman Domination in Generalized Petersen Graphs

Abstract

The double Roman domination can be described as a strengthened defense strategy. In an empire, each city can be protected by at most three troops. Every city having no troops must be adjacent to at least two cities with two troops or one city with three troops. Every city having one troop must be adjacent to at least one city with more than one troop. Such an assignment is called a double Roman dominating function (DRDF) of an empire/a graph. The minimum number of troops under such an assignment is the double Roman domination number, denoted as $$\gamma _{dR}$$ . Shao et al. (2018) determine the exact value of $$\gamma _{dR}(P(n,1))$$ . Jiang et al. (2018) determine $$\gamma _{dR}(P(n,2))$$ . In this article, we investigate the double Roman domination number of P(n, k) for $$k\ge 3$$ . We determine the exact value of $$\gamma _{dR}(P(n,k))$$ for $$n\equiv 0(\bmod 4)$$ and $$k\equiv 1(\bmod 2)$$ , and present an improved upper bound of $$\gamma _{dR}(P(n,k))$$ for $$n\not \equiv 0(\bmod 4)$$ or $$k\not \equiv 1(\bmod 2)$$ . Our results imply P(n, 3) for $$n\equiv 0(\bmod 4)$$ is double Roman which can partially answer the open question present by Beeler et al. (2016).