Stability of Rose Window graphs

Authors Milad Ahanjideh, István Kovács, Klavdija Kutnar

Publication date 2 June 2023

Abstract: A graph

G a m m a

is said to be stable if for the direct product

G a m m a i m e s m a t h b f K_{2}

,

m A u t (G a m m a i m e s m a t h b f K_{2})

is isomorphic to

m A u t (G a m m a) i m e s m a t h b b 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.

This page was built for publication: Stability of Rose Window graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6439022)