Skip to search formSkip to main contentSkip to account menu

Eternal dominating set

In graph theory, an eternal dominating set for a graph G = (V, E) is a subset D of V such that D is a dominating set on which mobile guards are… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Dominating setGraph (discrete mathematics)Graph theoryK-server problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Closing the Gap: Eternal Domination on 3 x n Grids
  • M. Messinger
  • Contributions Discret. Math.
  • 2017
  • Corpus ID: 27114397
The domination number for grid graphs has been a long studied problem; the first results appeared over thirty years ago [Jacobson… 
2017
2017
Spy Game in trees and grids
In the Spy game, a spy is placed first at some vertex of a graph G. Then, k > 0 guards are also occupying some vertices of G. At… 
2016
2016
Changing and Unchanging in m-Eternal Total Domination in Graphs
2016
2016
Spy-Game on Graphs
We define and study the following two-player game on a graph G. Let k in N^*. A set of k guards is occupying some vertices of G… 
2013
2013
Fractional Combinatorial Two-Player Games
: During the last decades, many combinatorial games involving two persons playing on a (directed) graph have received a lot of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)