Composing group automorphisms with colour-preserving automorphisms of Cayley graphs

Abstract

We show that if $\phi$ is a colour-permuting automorphism of a connected, finite Cayley graph, and the order of the Cayley graph is either odd or square-free, then $\phi$ is the composition of a group automorphism and a colour-preserving graph automorphism. Some analogous results are also established for isomorphisms between two different Cayley graphs.

9 pages