A note on the eternal dominating set problem

DOI10.1007/s00182-018-0623-0zbMath1416.91058OpenAlexW2802163802WikidataQ129869664 ScholiaQ129869664MaRDI QIDQ1791289

Serge Gaspers, Paul Ottaway, Stephen Finbow, Margaret-Ellen Messinger

Publication date: 4 October 2018

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00182-018-0623-0

zbMATH Keywords

combinatorial game theorygraph dominationeternal dominationgraph protection

Mathematics Subject Classification ID

Games involving graphs (91A43) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (5)

Eternal distance-\(k\) domination on graphs ⋮ The eternal dominating set problem for interval graphs ⋮ The game of cops and eternal robbers ⋮ Eternal and Secure Domination in Graphs ⋮ Eternally dominating large grids

Cites Work

• Exact exponential algorithms.
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• γ-graphs of graphs
• Domination in graphs with minimum degree two
• Protecting a graph with mobile guards
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the eternal dominating set problem