Domination, eternal domination, and clique covering
From MaRDI portal
Publication:2344016
DOI10.7151/dmgt.1799zbMath1311.05151arXiv1407.5235OpenAlexW2963899823MaRDI QIDQ2344016
William F. Klostermeyer, Christina M. Mynhardt
Publication date: 11 May 2015
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.5235
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Eternal domination and clique covering ⋮ Eternal domination on prisms of graphs ⋮ Eternal and Secure Domination in Graphs ⋮ On eternal domination and Vizing-type inequalities
Cites Work
- Vertex covers and eternal dominating sets
- Eternally secure sets, independence sets and cliques
- Tight bounds for eternal dominating sets in graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Protecting a graph with mobile guards
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item