Results 1 to 10 of about 5,027,974 (207)
The eternal dominating set problem for interval graphs [PDF]
Information Processing Letters, 2019 3 pages, one ...
Francisco Juan Soulignac
exaly +6 more sources
Vertex covers and eternal dominating sets [PDF]
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C M Mynhardt
exaly +5 more sources
On Eternal Domination of Generalized Js,m
Journal of Applied Mathematics, 2021 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.
Ramy Shaheen +2 more
doaj +2 more sources
Eternal dominating sets on digraphs and orientations of graphs
Discrete Applied Mathematics, 2021 34 ...
Guillaume Bagan
exaly +7 more sources
Eternal Domination of Generalized Petersen Graph
Journal of Applied Mathematics, 2021 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.
Ramy Shaheen, Ali Kassem
doaj +2 more sources
Tight bounds for eternal dominating sets in graphs
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John L. Goldwasser, William Klostermeyer
exaly +2 more sources
Eternal Independent Sets in Graphs [PDF]
Theory and Applications of Graphs, 2016 The use of mobile guards to protect a graph has received much attention in the literature of late in the form of eternal dominating sets, eternal vertex covers and other models of graph protection.
Yair Caro, William Klostermeyer
doaj +2 more sources
Eternal domination and clique covering
Electronic Journal of Graph Theory and Applications, 2022 We study the relationship between the eternal domination number of a graph and its clique cove-ring number using both large-scale computation and analytic methods. In doing so, we answer two open questions of Klostermeyer and Mynhardt.
Gary MacGillivray +2 more
doaj +1 more source
Domination, Eternal Domination, and Clique Covering
Discussiones Mathematicae Graph Theory, 2015 Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices. Eternal domination allows one guard to move per attack, whereas more than one guard may move per attack in the m-
Klostermeyer William F., Mynhardt C.M.
doaj +1 more source
An Eternal Domination Problem in Grids
Theory and Applications of Graphs, 2017 A dynamic domination problem in graphs is considered in which an infinite sequence of attacks occur at vertices with mobile guards; the guard at the attacked vertex is required to vacate the vertex by moving to a neighboring vertex with no guard.
William Klostermeyer +2 more
doaj +1 more source