Results 1 to 10 of about 39,709 (214)
Eternal dominating sets on digraphs and orientations of graphs
Discrete Applied Mathematics, 2021 34 ...
Hamamache Kheddouci
exaly +5 more sources
The eternal dominating set problem for interval graphs [PDF]
Information Processing Letters, 2019 3 pages, one ...
Francisco J Soulignac
exaly +5 more sources
Vertex covers and eternal dominating sets
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C M Mynhardt
exaly +4 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
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
exaly +3 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
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 +1 more source
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 +1 more source
Perpetually Dominating Large Grids [PDF]
, 2017 In the m-\emph{Eternal Domination} game, a team of guard tokens initially occupies a dominating set on a graph $G$. An attacker then picks a vertex without a guard on it and attacks it. The guards defend against the attack: one of them has to move to the
Lamprou, Ioannis +2 more
core +2 more sources
Protecting a Graph with Mobile Guards [PDF]
, 2015 Mobile guards on the vertices of a graph are used to defend it against attacks on either its vertices or its edges. Various models for this problem have been proposed.
Klostermeyer, William F. +1 more
core +1 more source