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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

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…

2013

: During the last decades, many combinatorial games involving two persons playing on a (directed) graph have received a lot of…