Eternal m-Security Bondage Numbers in Graphs
An eternal m-secure set of a graph G = (V,E) is a set S0 ⊆ V that can defend against any sequence of single-vertex attacks by means of multiple guard shifts along the edges of G. The eternal m-security number σm(G) is the minimum cardinality of an eternal m-secure set in G. The eternal m-security bo...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2018-11-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2054 |