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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2013-2017
012320132017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We define and study the following two-player game on a graph G. Let k ∈ N∗. A set of k guards is occupying some vertices of G… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2017
2017
A vertex u of a graph “t-dominates” a vertex v if there are at most t vertices different from u, v that are adjacent to v and not… (More)
Is this relevant?
2017
2017
We show that for every minimum eternal dominating set, D, of a graph G and every vertex v ∈ D, there is a sequence of attacks at… (More)
Is this relevant?
2017
2017
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… (More)
Is this relevant?
2016
2016
We define and study the following two-player game on a graph G. Let k ∈ N∗. A set of k guards is occupying some vertices of G… (More)
Is this relevant?
2015
2015
In the eternal dominating set problem, guards form a dominating set on a graph and at each step, a vertex is attacked. After each… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
During the last decades, many combinatorial games involving two persons playing on a (directed) graph have received a lot of… (More)
  • figure 1
Is this relevant?