Dynamic dominating sets: the eviction model for eternal domination

MaRDI QIDQ2829356zbMATHFDO

Authors William F. Klostermeyer, Mary Lawrence, Gary MacGillivray

Publication date 27 October 2016

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

zbMATH Keywords

independent setconnected dominating seteternal dominating setneo-colonization

Mathematics Subject Classification ID

2-person games (91A05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 2174620
• The eternal domination number for \(3\times n\) grid graphs
• Eternal distance-\(k\) domination on graphs
• A note on the eternal dominating set problem
• Tight bounds for eternal dominating sets in graphs

Cited in

(9)

• Representation of the eternal vertex cover problem as a dynamic Stackelberg game
• Eternal and Secure Domination in Graphs
• Limit theory of combinatorial optimization for random geometric graphs
• Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between
• Disjoint dominating sets with a perfect matching
• On eternal domination and Vizing-type inequalities
• Eternal domination: criticality and reachability
• Eternal domination and clique covering
• Eternal feedback vertex sets: a new graph protection model using guards

This page was built for publication: Dynamic dominating sets: the eviction model for eternal domination

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