Title
Maximum-Demand Graphs For Eternal Security
Keywords
Domination; Eternal security
Abstract
Informally, a set of guards positioned on the vertices of a graph G is called eternally secure if the guards are able to respond to vertex attacks by moving a single guard along a single edge after each attack regardless of how many attacks are made. The smallest number of guards required to achieve eternal security is the eternal security number of G, denoted es(G), and it is known to be no more than θv (G), the vertex clique cover number of G. We investigate conditions under which es(G) = θv(G).
Publication Date
5-1-2007
Publication Title
Journal of Combinatorial Mathematics and Combinatorial Computing
Volume
61
Number of Pages
111-127
Document Type
Article
Personal Identifier
scopus
Copyright Status
Unknown
Socpus ID
70349450851 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/70349450851
STARS Citation
Anderson, Mark; Brigham, Robert C.; Vitray, Richard P.; Barrientos, Christian; and Carrington, Julie R., "Maximum-Demand Graphs For Eternal Security" (2007). Scopus Export 2000s. 6600.
https://stars.library.ucf.edu/scopus2000/6600