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

Luke Morgan, Joy Morris, Gabriel Verret

    Research output: Contribution to journalArticlepeer-review

    3 Citations (Scopus)

    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.

    Original languageEnglish
    Pages (from-to)83-95
    Number of pages13
    JournalArs Mathematica Contemporanea
    Volume14
    Issue number1
    Publication statusPublished - 2018

    Fingerprint

    Dive into the research topics of 'Characterising CCA Sylow cyclic groups whose order is not divisible by four'. Together they form a unique fingerprint.

    Cite this