English

Colour-permuting automorphisms of complete Cayley graphs

Combinatorics 2024-04-16 v1

Abstract

Let GG be a (finite or infinite) group, and let KG=Cay(G;G{1})K_G = \mathrm{Cay} ( G;G \smallsetminus \{1\} ) be the complete graph with vertex set GG, considered as a Cayley graph of GG. Being a Cayley graph, it has a natural edge-colouring by sets of the form {s,s1}\{s, s^{-1}\} for sGs \in G. We prove that every colour-permuting automorphism of KGK_G is an affine map, unless GQ8×BG \cong Q_8 \times B, where Q8Q_8 is the quaternion group of order 88, and BB is an abelian group, such that b2b^2 is trivial for all bBb \in B. We also prove (without any restriction on GG) that every colour-permuting automorphism of KGK_G is the composition of a group automorphism and a colour-preserving graph automorphism. This was conjectured by D.P.Byrne, M.J.Donner, and T.Q.Sibley in 2013.

Keywords

Cite

@article{arxiv.2404.09367,
  title  = {Colour-permuting automorphisms of complete Cayley graphs},
  author = {Shirin Alimirzaei and Dave Witte Morris},
  journal= {arXiv preprint arXiv:2404.09367},
  year   = {2024}
}

Comments

16 pages, no figures

R2 v1 2026-06-28T15:53:55.625Z