Vertex covers and eternal dominating sets
DOI10.1016/J.DAM.2011.11.034zbMATH Open1408.05099OpenAlexW2038298858MaRDI QIDQ423932FDOQ423932
Authors: William F. Klostermeyer, Christina M. Mynhardt 
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.034
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eternal total domination in graphs.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tight bounds for eternal dominating sets in graphs
- Eternal security in graphs of fixed independence number
- Maximum-demand graphs for eternal security
- Graphs with equal eternal vertex cover and eternal domination numbers
- Edge protection in graphs
- Title not available (Why is that?)
Cited In (11)
- A substructure based lower bound for eternal vertex cover number
- Independent protection in graphs
- A dynamic domination problem in trees
- Eternally dominating large grids
- Eternal and Secure Domination in Graphs
- Graphs with equal eternal vertex cover and eternal domination numbers
- Trees with large \(m\)-eternal domination number
- Some algorithmic results for eternal vertex cover problem in graphs
- A new lower bound for the eternal vertex cover number of graphs
- Domination, eternal domination, and clique covering
- Eternal vertex cover on bipartite graphs
This page was built for publication: Vertex covers and eternal dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423932)
