On 2-arc-transitive graphs of order kpn

Luke Morgan; E. Swartz; Gabriel Verret

doi:10.1016/j.jctb.2015.11.001

On 2-arc-transitive graphs of order kpn

Luke Morgan, E. Swartz, Gabriel Verret

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

144 Downloads (Pure)

Abstract

© 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 language	English
Pages (from-to)	77-87
Number of pages	11
Journal	Journal of Combinatorial Theory. Series B
Volume	117
DOIs	https://doi.org/10.1016/j.jctb.2015.11.001
Publication status	Published - 1 Mar 2016

Access to Document

10.1016/j.jctb.2015.11.001

Morgan et. al, 2016 On 2-arc-transitive graphs
© <2015>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
Accepted author manuscript, 150 KBLicence: CC BY-NC-ND

Cite this

@article{333711bc09e749839506312d12e27504,

title = "On 2-arc-transitive graphs of order kpn",

abstract = "{\textcopyright} 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{\v c}nik.",

author = "Luke Morgan and E. Swartz and Gabriel Verret",

year = "2016",

month = mar,

day = "1",

doi = "10.1016/j.jctb.2015.11.001",

language = "English",

volume = "117",

pages = "77--87",

journal = "Journal of combinatorial Theory Series B",

issn = "0095-8956",

publisher = "Academic Press",

}

TY - JOUR

T1 - On 2-arc-transitive graphs of order kpn

AU - Morgan, Luke

AU - Swartz, E.

AU - Verret, Gabriel

PY - 2016/3/1

Y1 - 2016/3/1

N2 - © 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.

AB - © 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.

UR - http://www.scopus.com/inward/record.url?scp=84947594305&partnerID=8YFLogxK

U2 - 10.1016/j.jctb.2015.11.001

DO - 10.1016/j.jctb.2015.11.001

M3 - Article

VL - 117

SP - 77

EP - 87

JO - Journal of combinatorial Theory Series B

JF - Journal of combinatorial Theory Series B

SN - 0095-8956

ER -

On 2-arc-transitive graphs of order kpn

Abstract

Access to Document

Other files and links

Fingerprint

Enumeration of Vertex Transitive Graphs

Cayley Graphs & their Associated Geometric & Combinatorial Objects

Harnessing Symmetry to Advance the Study of Graphs

Cite this

On 2-arc-transitive graphs of order kpn

Abstract

Access to Document

Other files and links

Fingerprint

Projects

Enumeration of Vertex Transitive Graphs

Cayley Graphs & their Associated Geometric & Combinatorial Objects

Harnessing Symmetry to Advance the Study of Graphs

Cite this