Dynamic dominating sets: the eviction model for eternal domination
zbMATH Open1368.05112MaRDI QIDQ2829356FDOQ2829356
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)
Recommendations
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)
Cited In (8)
- Eternal feedback vertex sets: a new graph protection model using guards
- Limit theory of combinatorial optimization for random geometric graphs
- Eternal and Secure Domination in Graphs
- Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between
- On eternal domination and Vizing-type inequalities
- Eternal domination and clique covering
- Eternal domination: criticality and reachability
- Disjoint dominating sets with a perfect matching
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)