On the orders of arc-transitive graphs

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

A graph is called arc-transitive (or symmetric) if its automorphism group has a single orbit on ordered pairs of adjacent vertices, and 2-arc-transitive its automorphism group has a single orbit on ordered paths of length 2. In this paper we consider the orders of such graphs, for given valency. We prove that for any given positive integer k, there exist only finitely many connected 3-valent 2-arc-transitive graphs whose order is kp for some prime p, and that if d≥4, then there exist only finitely many connected d-valent 2-arc-transitive graphs whose order is kp or kp2 for some prime p. We also prove that there are infinitely many (even) values of k for which there are only finitely many connected 3-valent symmetric graphs of order kp where p is prime.

Cite

CITATION STYLE

APA

Conder, M. D. E., Li, C. H., & Potočnik, P. (2015). On the orders of arc-transitive graphs. Journal of Algebra, 421, 167–186. https://doi.org/10.1016/j.jalgebra.2014.08.025

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free