Elusive groups of automorphisms of digraphs of small valency

Michael Giudici, Luke Morgan, P. Potočnik, Gabriel Verret

    Research output: Contribution to journalArticlepeer-review

    8 Citations (Scopus)


    © 2014 Elsevier Ltd. A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of connected digraphs of out-valency at most three.
    Original languageEnglish
    Pages (from-to)1-9
    JournalEuropean Journal of Combinatorics
    Publication statusPublished - May 2015


    Dive into the research topics of 'Elusive groups of automorphisms of digraphs of small valency'. Together they form a unique fingerprint.

    Cite this