Projects per year
© 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.
|Number of pages||11|
|Journal||Journal of Combinatorial Theory. Series B|
|Publication status||Published - 1 Mar 2016|
FingerprintDive into the research topics of 'On 2-arc-transitive graphs of order kpn'. Together they form a unique fingerprint.
- 3 Finished
Enumeration of Vertex Transitive Graphs
1/01/13 → 10/02/16
Cayley Graphs & their Associated Geometric & Combinatorial Objects
Li, C. & Bamberg, J.
1/01/12 → 30/06/17
Harnessing Symmetry to Advance the Study of Graphs
1/01/12 → 31/12/16