Comparison of eternal domination and eviction numbers

Determine whether there exists a graph G for which the eternal domination number satisfies γ^∞(G)<e^∞(G).

Background

The eternal domination number γ∞(G) and the eviction number e∞(G) arise from different guard-movement rules. The paper records as unresolved whether the eviction game can require strictly more guards than the standard eternal domination game for some graph.

References

Does there exist a graph $G$ such that $\gamma\infty(G)<e\infty(G)$?

— Bounding the Eviction Number of a Graph in Terms of its Independence Number  (2509.19535 - MacGillivray et al., 23 Sep 2025) in Section 2, after Question \ref{Question:Eviction_c*alpha}