A method for eternally dominating strong grids

DOI10.23638/DMTCS-22-1-8zbMath1450.05065arXiv2003.01495MaRDI QIDQ5130743

Alexander Hassler, Andrés Zacarías, Alizée Gagnon, Fionn Mc Inerney, Ben Seamone, Virgélot Virgile, Aaron Krim-Yee, Jerry Huang

Publication date: 28 October 2020

Full work available at URL: https://arxiv.org/abs/2003.01495

zbMATH Keywords

combinatorial gameseternal dominationgraph protection

Mathematics Subject Classification ID

Games involving graphs (91A43) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (3)

Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between ⋮ Eternal distance-\(k\) domination on graphs ⋮ Irreversible k-threshold conversion number of some graphs

Cites Work

• Study of a combinatorial game in graphs through linear programming
• Eternal domination in grids
• Eternally dominating large grids
• The eternal dominating set problem for proper interval graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• The Domination Number of Grids
• Protecting a graph with mobile guards
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A method for eternally dominating strong grids