

A095424


Number of connected simple edgetransitive graphs on n vertices.


1



1, 1, 2, 3, 4, 6, 5, 8, 9, 13, 7, 19, 10, 16, 25, 26, 12, 28, 12, 43, 37, 24, 13, 65, 34, 31, 51, 64, 18, 93, 19, 83, 44, 34, 67, 154, 24, 36, 60, 175, 26, 147, 25, 88, 161, 46, 25
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


LINKS

Table of n, a(n) for n=1..47.
Marston Conder, All connected edgetransitive graphs on up to 47 vertices
Eric Weisstein's World of Mathematics, EdgeTransitive Graph


EXAMPLE

For n = 1: K_1
For n = 2: K_2
For n = 3: P_3, K_3
For n = 4: K_{1,3}, Q_2, K_4
For n = 5: K_{2,3}, C_5, K_5, K_{1,4}


CROSSREFS

Cf. A095352 (number of not necessarily connected edgetransitive graphs on n vertices).
Sequence in context: A263267 A257471 A053212 * A194507 A118316 A197756
Adjacent sequences: A095421 A095422 A095423 * A095425 A095426 A095427


KEYWORD

nonn,more


AUTHOR

Eric W. Weisstein, Jun 04 2004, corrected Mar 05 2008


EXTENSIONS

a(8) corrected and a(9) added by Eric W. Weisstein, May 11 2017
a(8)a(11) added by Eric W. Weisstein, May 11 2017 (communicated by Darren Narayan)
a(12)a(19) added by Eric W. Weisstein, Jun 27 2017 (computed and communicated by Darren Narayan, Heather Newman, and Hector Miranda)
a(20) added by Eric W. Weisstein, Aug 09 2017 (computed and communicated by Darren Narayan, Heather Newman, and Hector Miranda)
a(21)a(47) added by Gabriel Verret, Nov 13 2017


STATUS

approved



