2021 Eternal Domination of Generalized Petersen Graph
Ramy Shaheen, Ali Kassem
Author Affiliations +
J. Appl. Math. 2021: 1-10 (2021). DOI: 10.1155/2021/6627272


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 γmG. In this paper, we find γmPn,1 and γmPn,3 for n0mod4. We also find upper bounds for γmPn,2 and γmPn,3 when n is arbitrary.


This work was supported by the Faculty of Science, Tishreen University, Syria.


Download Citation

Ramy Shaheen. Ali Kassem. "Eternal Domination of Generalized Petersen Graph." J. Appl. Math. 2021 1 - 10, 2021. https://doi.org/10.1155/2021/6627272


Received: 4 October 2020; Accepted: 2 January 2021; Published: 2021
First available in Project Euclid: 28 July 2021

Digital Object Identifier: 10.1155/2021/6627272

Rights: Copyright © 2021 Hindawi


This article is only available to subscribers.
It is not available for individual sale.

Vol.2021 • 2021
Back to Top