Generalized Petersen graphs which are cycle permutation graphs (Q790849): Difference between revisions

A cycle permutation graph is obtained by taking two n-cycles each labelled 1,2,...,n, along with the edges obtained by joining i in the first copy to \(\alpha\) (i) in the second, where \(\alpha \in S_ n\). A characterization of the intersection between cycle permutation graphs and the generalized Petersen graphs as defined by \textit{M. E. Watkins} [J. Comb. Theory 6, 152-164 (1969; Zbl 0175.503)], is given.