On cycle permutation graphs

Permutation graphs were first introduced by Chartrand and Harary in 1967 5]. The purpose of this paper is to study some properties of cycle permutation graphs. A determination of some of their crossing numbers, in keeping with the topological nature of the Chartrand and Harary paper is followed by the determination of all permutations yielding certain isomorphic permutation graphs, extending the algebraic results for planar graphs obtained by those authors.