A286280 Number of connected arc-transitive graphs of order n.

1, 1, 2, 2, 4, 2, 5, 4, 8, 2, 11, 4, 8, 10, 15, 4, 14, 3, 22, 13, 8, 2, 34, 11, 13, 20, 26, 4, 41

Offset

2,3

Comments

Care is needed with "symmetric" terminology, which is variously used to mean both arc-transitive and both vertex- and edge-transitive.

The first known difference from A133181 (connected vertex- and edge-transitive graphs on n vertices) occurs at a(27), corresponding to the Doyle graph (which is both edge- and vertex-transitive but not arc-transitive). - Eric W. Weisstein, May 13 2017

Links

Table of n, a(n) for n=2..30.

Marston Conder, Home Page (Contains tables of regular maps, hypermaps and polytopes, trivalent symmetric graphs, and surface actions)

Marston Conder, Connected symmetric (arc-transitive) graphs of order 2 to 30

Eric Weisstein's World of Mathematics, Arc-Transitive Graph

Eric Weisstein's World of Mathematics, Doyle Graph

Eric Weisstein's World of Mathematics, Edge-Transitive Graph

Eric Weisstein's World of Mathematics, Symmetric Graph

Eric Weisstein's World of Mathematics, Vertex-Transitive Graph

Crossrefs

Cf. A133181 (number of connected vertex- and edge-transitive graphs on n vertices).

Cf. A180240 (number of arc-transitive simple graphs on n nodes).

Sequence in context: A241814 A088371 A133181 * A290088 A179013 A090397

Adjacent sequences: A286277 A286278 A286279 * A286281 A286282 A286283

Keyword

nonn,more

Author

N. J. A. Sloane, May 08 2017

Status

approved