Results 191 to 200 of about 5,027,974 (207)

The Eternal Dominating Set problem for proper interval graphs

Information Processing Letters, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cid de Souza
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

A note on the eternal dominating set problem

International Journal of Game Theory, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stephen Finbow, Serge Gaspers, Margaret-Ellen Messinger   +2 more
exaly   +2 more sources

Dynamic dominating sets: the eviction model for eternal domination

, 2016
In a graph \(G = (V,E)\), a dominating set \(D\) is a subset of the vertices \(V\) such that every vertex is either in \(D\) or adjacent to one. Applications of dominating sets include communications, distributed computing and security. For instance, each node in the graph represents a strategic site that needs protection, and two nodes are connected ...
Klostermeyer, William F., Lawrence, Mary, MacGillivray, Gary   +2 more
core   +3 more sources

Eternally dominating large grids [PDF]

Theoretical Computer Science, 2019
© 2018 Elsevier B.V. In the m-Eternal Domination game, a team of guard tokens initially occupies a dominating set on a graph G. An attacker then picks a vertex without a guard on it and attacks it. The guards defend against the attack: one of them has to
Ioannis Lamprou, Russell Martin, Sven Schewe   +2 more
exaly   +2 more sources

Fast Winning Strategies for the Attacker in Eternal Domination [PDF]

Lecture Notes in Computer Science
Dominating sets in graphs are often used to model some monitoring of the graph: guards are posted on the vertices of the dominating set, and they can thus react to attacks occurring on the unguarded vertices by moving there (yielding a new set of guards,
Theo Pierron, Nicolas Bousquet, Nacim Oijid   +2 more
exaly   +2 more sources

Eternal Distance-k Domination on Graphs

La Matematica, 2023
Erin Meger
exaly  

Eternal domination on prisms of graphs

Discrete Applied Mathematics, 2020
Benjamin Seamone
exaly  

Graphs with equal eternal vertex cover and eternal domination numbers

Discrete Mathematics, 2011
William F Klostermeyer, C M Mynhardt
exaly  

Trees with large m-eternal domination number

Discrete Applied Mathematics, 2016
Michael Henning, William F Klostermeyer
exaly  

Foolproof eternal domination in the all-guards move model

Mathematica Slovaca, 2012
Gary Macgillivray, William Klostermeyer   +1 more
exaly