A180240 Number of arc-transitive simple graphs on n nodes.

0, 1, 1, 3, 2, 6, 2, 8, 5, 11, 2, 19, 4, 11, 13, 23, 4, 24, 3, 35, 16, 11, 2, 58, 13, 18, 25, 39, 4, 67, 4

Offset

1,4

Comments

Where "arc-transitive" here means 1-arc-transitive. (Trees may be (s+1)-transitive while not s-transitive.) Considering empty graphs to not be arc-transitive.

Links

Table of n, a(n) for n=1..31.

Gordon Royle. Transitive Graphs

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

Example

For n=2: P_2.  For n=3: C_3.  For n=4: 2C_2, C_4, K_4.  For n=5: C_5, K_5.

Crossrefs

Cf. A286280 (number of connected arc-transitive graphs of order n).

Sequence in context: A071044 A077066 A324890 * A065228 A092843 A078589

Adjacent sequences: A180237 A180238 A180239 * A180241 A180242 A180243

Keyword

nonn,hard,more

Author

Eric W. Weisstein, Jan 16 2011

Extensions

Extended by Eric W. Weisstein, Jan 17 2011

Status

approved