Affiliation:
1. UP IAM University of Primorska Koper Slovenia
2. UP FAMNIT University of Primorska Koper Slovenia
Abstract
AbstractA graph is said to be stable if for the direct product is isomorphic to ; otherwise, it is called unstable. An unstable graph is called nontrivially 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 nontrivially unstable Rose Window graphs (2008). In this paper we show that the conjecture is true.
Funder
Javna Agencija za Raziskovalno Dejavnost RS