1.
Colour-permuting automorphisms of complete Cayley graphsShirin Alimirzaei,
Dave Witte Morris, 2025, izvirni znanstveni članek
Opis: Let G be a (finite or infinite) group, and let KG = Cay(G; G \ {1}) be the complete graph with vertex set G, considered as a Cayley graph of G. Being a Cayley graph, it has a natural edge-colouring by sets of the form {s, s-1} for s in G. We prove that every colour-permuting automorphism of KG is an affine map, unless G is isomoprhic to the direct product of Q8 and B, where Q8 is the quaternion group of order 8, and B is an abelian group, such that b2 is trivial for all b in B.
We also prove (without any restriction on G) that every colour-permuting automorphism of KG 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.
Ključne besede: Cayley graph, automorphism, colour-permuting, complete graphs
Objavljeno v RUP: 03.11.2025; Ogledov: 266; Prenosov: 1
Celotno besedilo (453,60 KB)