An Eternal Domination Problem in Grids

DOI10.20429/TAG.2017.040102MaRDI QIDQ5225530zbMATH OpenOpenAlexFDO

Authors William F. Klostermeyer, Margaret-Ellen Messinger, Alejandro Angeli Ayello

Publication date 22 July 2019

Published in Theory and Application of Graphs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.20429/tag.2017.040102

zbMATH Keywords

mobile guards$m$-eviction number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Eternal domination in grids
• A method for eternally dominating strong grids
• Eternal domination on \(3 \times n\) grid graphs
• Closing the gap: eternal domination on \(3 \times n\) grids
• The domination number of grids
• Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between
• The eternal domination number for \(3\times n\) grid graphs
• Eternal domination numbers of \(4\times n\) grid graphs
• A note on the eternal dominating set problem
• Eternal domination numbers of \(5\times n\) grid graphs

Cited in

(4)

• A heuristic approach to domino grid problem
• Eternal and Secure Domination in Graphs
• Vertex Domination in Dynamic Networks
• Disjoint dominating sets with a perfect matching

This page was built for publication: An Eternal Domination Problem in Grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225530)