Eternal domination on prisms of graphs

02/02/2019

∙

by   Aaron Krim-Yee, et al.

∙

0

∙

share

An eternal dominating set of a graph G is a set of vertices (or "guards") which dominates G and which can defend any infinite series of vertex attacks, where an attack is defended by moving one guard along an edge from its current position to the attacked vertex. The size of the smallest eternal dominating set is denoted γ^∞(G) and is called the eternal domination number of G. In this paper, we answer a conjecture of Klostermeyer and Mynhardt [Discussiones Mathematicae Graph Theory, vol. 35, pp. 283-300], showing that there exist there are infinitely many graphs G such that γ^∞(G)=θ(G) and γ^∞(G K_2)<θ(G K_2), where θ(G) denotes the clique cover number of G.