A method for eternally dominating strong grids

A method for eternally dominating strong grids

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 adjacent vertices and no more than one guard may occupy a vertex. The goal is to determine the eternal domination number o...

Full description

Bibliographic Details
Main Authors: Alizée Gagnon, Alexander Hassler, Jerry Huang, Aaron Krim-Yee, Fionn Mc Inerney, Andrés Zacarías, Ben Seamone, Virgélot Virgile
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2020-03-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
graphs
graph protection
eternal domination
combinatorial games
[info.info-dm]computer science [cs]/discrete mathematics [cs.dm]
[math.math-co]mathematics [math]/combinatorics [math.co]
Online Access:https://dmtcs.episciences.org/5162/pdf

Internet

https://dmtcs.episciences.org/5162/pdf

Similar Items