Generalized petersen graphs which are cycle permutation graphs

Abstract

A cycle permutation graph is obtained by taking two n-cycles each labeled 1, 2,…, n, along with the edges obtained by joining i in the first copy to α( i) in the second, where α ∈ S n . A characterization of the intersection between cycle permutation graphs and the generalized Petersen graphs as defined by Watkins ( J. Combin. Theory 6 (1969), 152–164), is given.