An Upper Bound for the Eternal Roman Domination Number
Imagine using mobile guards to defend the vertices of a graph <i>G</i> from a sequence of attacks subject to the conditions that after each attack: (i) each guard either remains in place or moves to an adjacent vertex; (ii) the configuration of guards forms a Roman-dominating set; and (i...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-01-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/3/437 |