3 citations · 3 across the 4 of their papers we have counts for
6 papers
Bounding the Eviction Number of a Graph in Terms of its Independence Number
Gary MacGillivray, Christina Mynhardt, Virgelot Virgile
An eternal dominating family of graph in the eviction game is a collection of dominating sets of such that (a) for a…
Fractional eternal domination: securely distributing resources across a network
Fnu Devvrit, Aaron Krim-Yee, Nithish Kumar +4
This paper initiates the study of fractional eternal domination in graphs, a natural relaxation of the well-studied eternal domination problem. We study the connections to flows an…
Eternal Domination and Clique Covering
Gary MacGillivray, C. M. Mynhardt, Virgélot Virgile
We study the relationship between the eternal domination number of a graph and its clique covering number using both large-scale computation and analytic methods. In doing so, we a…
A method for eternally dominating strong grids
Alizée Gagnon, Alexander Hassler, Jerry Huang +5
In the eternal domination game, an attacker attacks a vertex at each turn and a team of guards must move a guard to the attacked vertex to defend it. The guards may only move to ad…
Eternal domination on prisms of graphs
Aaron Krim-Yee, Ben Seamone, Virgélot Virgile
An eternal dominating set of a graph is a set of vertices (or "guards") which dominates and which can defend any infinite series of vertex attacks, where an attack is defen…
A study of cops and robbers in oriented graphs
Devvrit Khatri, Natasha Komarov, Aaron Krim-Yee +4
We consider the well-studied cops and robbers game in the context of oriented graphs, which has received surprisingly little attention to date. We examine the relationship between…