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 initially located (at most one guard may be located on any vertex). The set D must be such that for any infinite sequence of attacks occurring sequentially at vertices, the set D can be modified by moving a guard from an adjacent vertex to the attacked vertex, provided the attacked vertex has no guard on it at the time it is attacked. The configuration of guards after each attack must induce a dominating set. The eternal domination number, γ∞(G), is the minimum number of vertices possible in the initial set D. For example, the eternal domination number of the cycle on five vertices is two.
Link from a Wikipage to another Wikipage
primaryTopic
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 initially located (at most one guard may be located on any vertex). The set D must be such that for any infinite sequence of attacks occurring sequentially at vertices, the set D can be modified by moving a guard from an adjacent vertex to the attacked vertex, provided the attacked vertex has no guard on it at the time it is attacked. The configuration of guards after each attack must induce a dominating set. The eternal domination number, γ∞(G), is the minimum number of vertices possible in the initial set D. For example, the eternal domination number of the cycle on five vertices is two.
has abstract
In graph theory, an eternal do ...... r problem in computer science.
@en
Link from a Wikipage to an external page
Wikipage page ID
45,455,813
page length (characters) of wiki page
Wikipage revision ID
944,069,980
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
In graph theory, an eternal do ...... cycle on five vertices is two.
@en
label
Eternal dominating set
@en