pith. sign in

arxiv: 1411.6732 · v2 · pith:XY7X4WYWnew · submitted 2014-11-25 · 🧮 math.CO

On colour-preserving automorphisms of Cayley graphs

classification 🧮 math.CO
keywords automorphismscayleygroupsautomorphismeverygraphpropertyanalogous
0
0 comments X
read the original abstract

We study the automorphisms of a Cayley graph that preserve its natural edge-colouring. More precisely, we are interested in groups G, such that every such automorphism of every connected Cayley graph on G has a very simple form: the composition of a left-translation and a group automorphism. We find classes of groups that have the property, and we determine the orders of all groups that do not have the property. We also have analogous results for automorphisms that permute the colours, rather than preserving them.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.