Protecting a graph with mobile guards
From MaRDI portal
Abstract: Mobile guards on the vertices of a graph are used to defend it against attacks on either its vertices or its edges. Various models for this problem have been proposed. In this survey we describe a number of these models with particular attention to the case when the attack sequence is infinitely long and the guards must induce some particular configuration before each attack, such as a dominating set or a vertex cover. Results from the literature concerning the number of guards needed to successfully defend a graph in each of these problems are surveyed.
Cited in
(38)- The eternal dominating set problem for interval graphs
- Perfect Italian domination in trees
- A note on the eternal dominating set problem
- Eternal domination of generalized Petersen graph
- On eternal domination of generalized \(J_{s,m}\)
- Limit theory of combinatorial optimization for random geometric graphs
- Eternal domination on prisms of graphs
- Dominating vertex covers: the vertex-edge domination problem
- Domination, eternal domination, and clique covering
- The eternal dominating set problem for proper interval graphs
- On the strong Roman domination number of graphs
- Eternal dominating sets on digraphs and orientations of graphs
- Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between
- Trees with large \(m\)-eternal domination number
- Eternal and Secure Domination in Graphs
- Independent protection in graphs
- Disjoint dominating sets with a perfect matching
- On eternal domination and Vizing-type inequalities
- Eternal domination and clique covering
- Eternal domination: criticality and reachability
- ON THE CHARACTERIZATION OF ROMAN DOMINATING SETS IN TREES
- The eternal domination number for \(3\times n\) grid graphs
- A method for eternally dominating strong grids
- Italian domination in trees
- Vertex-edge domination in graphs
- Eternal distance-k domination on graphs
- Representation of the eternal vertex cover problem as a dynamic Stackelberg game
- Stability of vertex covers in a game with finitely many steps
- Distance and related domination parameters in the edge corona product of graphs
- On the eternal domination number of planar graphs with diameter 2
- Autonomous domination
- Two step graph protection game
- (Eternal) vertex cover numbers of infinite and finite grid graphs
- Fractional eternal domination: securely distributing resources across a network
- Reconfiguration using generalized token jumping
- Note on the eternal domination number of planar graphs and vertex-critical graphs
- Bounds for (strong) Roman k-dominations
- Bounding the eviction number of a graph in terms of its independence number
This page was built for publication: Protecting a graph with mobile guards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5279864)
