加载中…
We show that if 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 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本