Eternal Domination of Generalized Petersen Graph

Ramy Shaheen and Ali Kassem

Journal of Applied Mathematics, 2021, vol. 2021, issue 1

Abstract: An eternal dominating set of a graph G is a set of guards distributed on the vertices of a dominating set so that each vertex can be occupied by one guard only. These guards can defend any infinite series of attacks; an attack is defended by moving one guard along an edge from its position to the attacked vertex. We consider the “all guards move” of the eternal dominating set problem, in which one guard has to move to the attacked vertex and all the remaining guards are allowed to move to an adjacent vertex or stay in their current positions after each attack in order to form a dominating set on the graph and at each step can be moved after each attack. The “all guards move model” is called the m‐eternal domination model. The size of the smallest m‐eternal dominating set is called the m‐eternal domination number and is denoted by γm∞G. In this paper, we find γm∞Pn,1 and γm∞Pn,3 for n ≡ 0 (mod 4). We also find upper bounds for γm∞Pn,2 and γm∞Pn,3 when n is arbitrary.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2021/6627272

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2021:y:2021:i:1:n:6627272

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().