Eternal and Secure Domination in Graphs
From MaRDI portal
Publication:3384616
Recommendations
- Secure domination and secure total domination in graphs
- On secure domination in graphs
- scientific article; zbMATH DE number 2174620
- Eternal m-security in certain classes of graphs
- Perfect secure domination in graphs
- scientific article; zbMATH DE number 5575574
- Tight bounds for eternal dominating sets in graphs
- Eternal total domination in graphs.
- Secure total domination in graphs
- Connected eternal domination in graphs
Cites work
- A characterization of trees with equal independent domination and secure domination numbers
- A linear algorithm for secure domination in trees
- A new bound on the domination number of connected cubic graphs
- A note on the eternal dominating set problem
- A note on the paper ``Eternal security in graphs by Goddard, Hedetniemi, and Hedetniemi (2005)
- An Eternal Domination Problem in Grids
- Bounds for the m-eternal domination number of a graph
- Bounds on weak Roman and 2-rainbow domination numbers
- Closing the gap: eternal domination on 3 n grids
- Co-secure and secure domination in graphs
- Complexity issues of variants of secure domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Defending the Roman Empire---a new strategy
- Domination, eternal domination, and clique covering
- Dynamic dominating sets: the eviction model for eternal domination
- Edge criticality in secure graph domination
- Edge stability in secure graph domination
- Eternal domination in grids
- Eternal domination in trees
- Eternal domination numbers of 4 n grid graphs
- Eternal domination numbers of 5 n grid graphs
- Eternal domination on 3 n grid graphs
- Eternal domination: criticality and reachability
- Eternal protection in grid graphs
- Eternal security in graphs of fixed independence number
- Eternal total domination in graphs.
- Eternally secure sets, independence sets and cliques
- Finite Dominating Sets for Network Location Problems
- Further results on secure restrained domination in graphs
- Global secure domination in graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Graphs with equal eternal vertex cover and eternal domination numbers
- scientific article; zbMATH DE number 6506585 (Why is no real title available?)
- scientific article; zbMATH DE number 5575574 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 2174620 (Why is no real title available?)
- scientific article; zbMATH DE number 2094533 (Why is no real title available?)
- scientific article; zbMATH DE number 2104838 (Why is no real title available?)
- scientific article; zbMATH DE number 2114685 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 2188604 (Why is no real title available?)
- scientific article; zbMATH DE number 2188623 (Why is no real title available?)
- Irredundance, secure domination and maximum degree in trees
- Matching theory
- Maximum-demand graphs for eternal security
- Mortal and eternal vertex covers
- On computing a minimum secure dominating set in block graphs
- On eternal domination and Vizing-type inequalities
- On minimum secure dominating sets of graphs
- On secure domination in graphs
- On secure domination in trees
- On the secure domination numbers of maximal outerplanar graphs
- On the Shannon capacity of a graph
- Paths, Stars and the Number Three
- Perfect secure domination in graphs
- Protecting a graph with mobile guards
- Roman domination in graphs.
- Secure domination and secure total domination in graphs
- Secure domination critical graphs
- Secure domination in proper interval graphs
- Secure paired domination in graphs
- Secure restrained domination in graphs
- Secure total domination in graphs
- Secure total domination in graphs: bounds and complexity
- Security in graphs
- The complexity of secure domination problem in graphs
- The cost of edge failure with respect to secure graph domination
- The eternal dominating set problem for interval graphs
- The eternal dominating set problem for proper interval graphs
- The eternal domination number for \(3\times n\) grid graphs
- Tight bounds for eternal dominating sets in graphs
- Two algorithms for secure graph domination
- Upper secure domination number of a graph
- Vertex covers and eternal dominating sets
- Vertex Covers and Secure Domination in Graphs
Cited in
(9)- Tight bounds for eternal dominating sets in graphs
- scientific article; zbMATH DE number 5968475 (Why is no real title available?)
- scientific article; zbMATH DE number 5575574 (Why is no real title available?)
- scientific article; zbMATH DE number 2174620 (Why is no real title available?)
- Eternal domination and clique covering
- Eternal domination: criticality and reachability
- Fast winning strategies for the attacker in eternal domination
- Note on the eternal domination number of planar graphs and vertex-critical graphs
- Bounding the eviction number of a graph in terms of its independence number
This page was built for publication: Eternal and Secure Domination in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384616)
