Characterising CCA Sylow cyclic groups whose order is not divisible by four

Thumbnail Image
Files
Morris characterising CCA sylow cyclic groups.pdf(314.39 KB)
Date
2018
Authors
Morgan, Luke
Morris, Joy
Verret, Gabriel
Journal Title
Journal ISSN
Volume Title
Publisher
Drustvo Matematikov, Fizikov in Astronomov
Abstract
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.
Description
Open access, licensed under Creative Commons
Keywords
CCA problem , Caley , Edge-colouring , Sylow cyclic groups
Citation
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
URI
https://hdl.handle.net/10133/5158
Collections
Morris, Joy