Eternal protection in grid graphs

MaRDI QIDQ2860807zbMATH OpenFDO

Authors William F. Klostermeyer, John Goldwasser, Christina M. Mynhardt

Publication date 11 November 2013

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

eternal domination

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Games on graphs (graph-theoretic aspects) (05C57) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games involving graphs (91A43)

Review text

The authors consider a graph-theoretical game (``eternal domination) on grid graphs and derive enumerative results related to this game.

Cited in

(17)

• Eternal domination of generalized Petersen graph
• On eternal domination of generalized \(J_{s,m}\)
• Domination, eternal domination, and clique covering
• Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between
• Trees with large \(m\)-eternal domination number
• Eternal and Secure Domination in Graphs
• Independent protection in graphs
• Disjoint dominating sets with a perfect matching
• scientific article; zbMATH DE number 2174620 (Why is no real title available?)
• On eternal domination and Vizing-type inequalities
• A Dynamic Domination Problem
• The eternal domination number for \(3\times n\) grid graphs
• A method for eternally dominating strong grids
• A dynamic domination problem in trees
• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• Eternal feedback vertex sets: a new graph protection model using guards
• m-eternal domination and variants on some classes of finite and infinite graphs

This page was built for publication: Eternal protection in grid graphs

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