On 2-arc-transitive graphs of order kpn

Luke Morgan, E. Swartz, Gabriel Verret

    Research output: Contribution to journalArticlepeer-review

    4 Citations (Scopus)
    144 Downloads (Pure)


    © 2015 Elsevier Inc. We show that there exist functions c and g such that, if k, n and d are positive integers with d>g(n) and Γ is a d-valent 2-arc-transitive graph of order kpn with p a prime, then p≤kc(d). In other words, there are only finitely many d-valent 2-arc-transitive graphs of order kpn with d>g(n) and p prime. This generalises a recent result of Conder, Li and Potočnik.
    Original languageEnglish
    Pages (from-to)77-87
    Number of pages11
    JournalJournal of Combinatorial Theory. Series B
    Publication statusPublished - 1 Mar 2016


    Dive into the research topics of 'On 2-arc-transitive graphs of order kpn'. Together they form a unique fingerprint.

    Cite this