Characterising CCA Sylow cyclic groups whose order is not divisible by four
Drustvo Matematikov, Fizikov in Astronomov
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.
Open access, licensed under Creative Commons
CCA problem , Caley , Edge-colouring , Sylow cyclic groups
Morgan, L., Morris, J., & Verret, G. (2018). Characterising CCA Sylow cyclic groups whose order is not divisible by four. Ars Mathematica Contemporanea, 14, 83-95