Eternal and Secure Domination in Graphs
From MaRDI portal
Publication:3384616
DOI10.1007/978-3-030-51117-3_13OpenAlexW3094398332MaRDI QIDQ3384616
William F. Klostermeyer, Christina M. Mynhardt
Publication date: 15 December 2021
Published in: Topics in Domination in Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-51117-3_13
Related Items (1)
Cites Work
- Upper secure domination number of a graph
- Vertex covers and eternal dominating sets
- A characterization of trees with equal independent domination and secure domination numbers
- Eternal domination: criticality and reachability
- Bounds on weak Roman and 2-rainbow domination numbers
- Irredundance, secure domination and maximum degree in trees
- Secure domination critical graphs
- Matching theory
- Roman domination in graphs.
- Secure domination in proper interval graphs
- Global secure domination in graphs
- On the secure domination numbers of maximal outerplanar graphs
- On computing a minimum secure dominating set in block graphs
- The complexity of secure domination problem in graphs
- The eternal dominating set problem for interval graphs
- Edge criticality in secure graph domination
- Secure total domination in graphs: bounds and complexity
- A note on the eternal dominating set problem
- Defending the Roman Empire---a new strategy
- Secure paired domination in graphs
- Graphs with equal eternal vertex cover and eternal domination numbers
- Eternal domination in grids
- Eternally dominating large grids
- Domination, eternal domination, and clique covering
- The eternal dominating set problem for proper interval graphs
- On secure domination in graphs
- Eternally secure sets, independence sets and cliques
- Security in graphs
- Complexity issues of variants of secure domination in graphs
- Tight bounds for eternal dominating sets in graphs
- A linear algorithm for secure domination in trees
- A new bound on the domination number of connected cubic graphs
- Secure restrained domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Eternal Domination in Trees
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Vertex Covers and Secure Domination in Graphs
- Secure domination and secure total domination in graphs
- Finite Dominating Sets for Network Location Problems
- On the Shannon capacity of a graph
- Paths, Stars and the Number Three
- On eternal domination and Vizing-type inequalities
- Further results on secure restrained domination in graphs
- An Eternal Domination Problem in Grids
- On minimum secure dominating sets of graphs
- On secure domination in trees
- Protecting a graph with mobile guards
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Eternal and Secure Domination in Graphs
