Add to ORKGThe use of mobile guards to protect a graph has received much attention in the literature of late in the form of eternal dominating sets, eternal vertex covers and other models of graph protection. In this paper, eternal independent sets are introduced. These are independent sets such that the following can be iterated forever: a vertex in the independent set can be replaced with a neighboring vertex and the resulting set is independent
A vertex cover of a graph G = (V, E) is a subset S ⊆V such that every edge is incident with at least...
An eternal dominating set of a graph G is a set of guards distributed on the vertices of a dominatin...
An eternal dominating set of a graph G is a set of guards distributed on the vertices of a dominatin...
The use of mobile guards to protect a graph has received much attention in the literature of late in...
AbstractMobile guards on the vertices of a graph are used to defend it against an infinite sequence ...
AbstractThe eternal domination problem requires a graph to be protected against an infinitely long s...
The eternal domination problem requires a graph to be protected against an infinitely long sequence ...
AbstractMobile guards on the vertices of a graph are used to defend it against an infinite sequence ...
AbstractThe eternal domination number of a graph is the number of guards needed at vertices of the g...
A dynamic domination problem in graphs is considered in which an infinite sequence of attacks occur ...
Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against i...
A dynamic domination problem in graphs is considered in which an infinite sequence of attacks occur ...
International audienceCommunicated by Dachuan Xu Graph protection using mobile guards has received a...
© 2018 Elsevier B.V. In the m-Eternal Domination game, a team of guard tokens initially occupies a d...
Mobile guards on the vertices of a graph are used to defend the graph against an infinite sequence o...
A vertex cover of a graph G = (V, E) is a subset S ⊆V such that every edge is incident with at least...
An eternal dominating set of a graph G is a set of guards distributed on the vertices of a dominatin...
An eternal dominating set of a graph G is a set of guards distributed on the vertices of a dominatin...
The use of mobile guards to protect a graph has received much attention in the literature of late in...
AbstractMobile guards on the vertices of a graph are used to defend it against an infinite sequence ...
AbstractThe eternal domination problem requires a graph to be protected against an infinitely long s...
The eternal domination problem requires a graph to be protected against an infinitely long sequence ...
AbstractMobile guards on the vertices of a graph are used to defend it against an infinite sequence ...
AbstractThe eternal domination number of a graph is the number of guards needed at vertices of the g...
A dynamic domination problem in graphs is considered in which an infinite sequence of attacks occur ...
Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against i...
A dynamic domination problem in graphs is considered in which an infinite sequence of attacks occur ...
International audienceCommunicated by Dachuan Xu Graph protection using mobile guards has received a...
© 2018 Elsevier B.V. In the m-Eternal Domination game, a team of guard tokens initially occupies a d...
Mobile guards on the vertices of a graph are used to defend the graph against an infinite sequence o...
A vertex cover of a graph G = (V, E) is a subset S ⊆V such that every edge is incident with at least...
An eternal dominating set of a graph G is a set of guards distributed on the vertices of a dominatin...
An eternal dominating set of a graph G is a set of guards distributed on the vertices of a dominatin...