Eternal Domination of Generalized Petersen Graph

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 at...

Full description

Bibliographic Details
Main Authors: Ramy Shaheen, Ali Kassem
Format: Article
Language:English
Published: Hindawi Limited 2021-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2021/6627272

Similar Items