Eternal security in graphs of fixed independence number
From MaRDI portal
Recommendations
Cited in
(21)- Eternal domination on prisms of graphs
- Graphs with equal eternal vertex cover and eternal domination numbers
- Domination, eternal domination, and clique covering
- Eternally secure sets, independence sets and cliques
- Tight bounds for eternal dominating sets in graphs
- Eternal dominating sets on digraphs and orientations of graphs
- scientific article; zbMATH DE number 5968475 (Why is no real title available?)
- Eternal and Secure Domination in Graphs
- The guarding game is E-complete
- Independent protection in graphs
- Vertex covers and eternal dominating sets
- scientific article; zbMATH DE number 2174620 (Why is no real title available?)
- Eternal domination and clique covering
- A Dynamic Domination Problem
- A dynamic domination problem in trees
- A note on the paper ``Eternal security in graphs by Goddard, Hedetniemi, and Hedetniemi (2005)
- Guard games on graphs: keep the intruder out!
- Eternal feedback vertex sets: a new graph protection model using guards
- On the eternal domination number of planar graphs with diameter 2
- Fast winning strategies for the attacker in eternal domination
- Bounding the eviction number of a graph in terms of its independence number
This page was built for publication: Eternal security in graphs of fixed independence number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5441054)
