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...
Saved in:
Main Authors: | Ramy Shaheen, Ali Kassem |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2021/6627272 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On Eternal Domination of Generalized Js,m
by: Ramy Shaheen, et al.
Published: (2021-01-01) -
Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs
by: Ramy Shaheen, et al.
Published: (2020-01-01) -
Partition Dimension of Generalized Petersen Graph
by: Hassan Raza, et al.
Published: (2021-01-01) -
On the cooling number of the generalized Petersen graphs
by: Kai An Sim, et al.
Published: (2024-12-01) -
The Metric Dimension of Some Generalized Petersen Graphs
by: Zehui Shao, et al.
Published: (2018-01-01)