Eternal domination numbers of 5 n grid graphs

zbMATH Open1405.05139MaRDI QIDQ2829338FDOQ2829338

Authors: C. M. van Bommel, Martin F. van Bommel 

Publication date: 27 October 2016

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Recommendations

• The eternal domination number for \(3\times n\) grid graphs
• Eternal domination on \(3 \times n\) grid graphs
• Eternal domination numbers of \(4\times n\) grid graphs
• Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between

Mathematics Subject Classification ID

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

Cited In (10)

• Study of a combinatorial game in graphs through linear programming
• Study of a combinatorial game in graphs through linear programming
• Eternal domination numbers of \(4\times n\) grid graphs
• The eternal domination number for \(3\times n\) grid graphs
• Eternal and Secure Domination in Graphs
• Closing the gap: eternal domination on \(3 \times n\) grids
• An Eternal Domination Problem in Grids
• Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between
• Eternal distance-\(k\) domination on graphs
• Eternal domination on \(3 \times n\) grid graphs

This page was built for publication: Eternal domination numbers of \(5\times n\) grid graphs

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