Stability of Rose Window graphs

Abstract

A graph $\hat{I}“$ is said to be stable if for the direct product $\hat{I}“\times {\mathbf{K}}_2$, $\mathrm{Aut}(\hat{I}“\times {\mathbf{K}}_2)$ is isomorphic to $\mathrm{Aut}(\hat{I}“)\times {\mathbb{Z}}_2$; otherwise, it is called unstable. An unstable graph is called non-trivially unstable when it is not bipartite and no two vertices have the same neighborhood. Wilson described nine families of unstable Rose Window graphs and conjectured that these contain all non-trivially unstable Rose Window graphs (2008). In this paper we show that the conjecture is true.