Characterising CCA Sylow cyclic groups whose order is not divisible by four
DOI:
https://doi.org/10.26493/1855-3974.1332.b49Keywords:
CCA problem, Cayley graphs, edge-colouring, Sylow cyclic groupsAbstract
A Cayley graph on a group G has a natural edge-colouring. We say that such a graph is CCA if every automorphism of the graph that preserves this edge-colouring is an element of the normaliser of the regular representation of G. A group G is then said to be CCA if every connected Cayley graph on G is CCA.
Our main result is a characterisation of non-CCA graphs on groups that are Sylow cyclic and whose order is not divisible by four. We also provide several new constructions of non-CCA graphs.
Downloads
Published
2017-05-09
Issue
Section
Articles
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/