On Eternal Domination of Generalized Js,m
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: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2021/8882598 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|