78 citations · 83 across the 7 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2020★ 3 cited
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…
cs.DM2019
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…