Eternal domination numbers of 5 n grid graphs

zbMATH Open1405.05139MaRDI QIDQ2829338FDOQ2829338

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

Publication date: 27 October 2016

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

Mathematics Subject Classification ID

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

Cited In (7)

• Study of a combinatorial game in graphs through linear programming
• Eternally dominating large grids
• Eternal and Secure Domination in Graphs
• An Eternal Domination Problem in Grids
• Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between
• Title not available (Why is that?)
• Eternal distance-\(k\) domination on 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)