On the orders of arc-transitive graphs

From MaRDI portal
(Redirected from Publication:468696)




Abstract: A graph is called {em arc-transitive} (or {em 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 dge4, 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.



Cites work



Describes a project that uses

Uses Software





This page was built for publication: On the orders of arc-transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468696)