

A095352


Number of (not necessarily connected) edgetransitive simple graphs on n vertices.


2



1, 2, 4, 8, 12, 21, 26, 38, 49, 67, 74, 105, 115, 137, 168, 206, 218, 264, 276, 340, 384, 416, 429, 533, 571, 613, 675, 764, 782, 926, 945, 1066, 1119, 1166, 1242, 1464, 1488, 1537, 1609, 1856, 1882, 2102, 2121, 2244, 2445, 2505, 2530
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

By convention, P_2 and the empty graphs are considered edgetransitive.


LINKS

Table of n, a(n) for n=1..47.
Lucas Mol, Sage code to generate graphs in graph6 format
Lucas Mol, Lists of edgetransitive graphs in graph6 format
Eric Weisstein's World of Mathematics, EdgeTransitive Graph


EXAMPLE

For n = 1: K_1 (1 graph)
For n = 2: \bar K_2, K_2 (2 graphs)
For n = 3: \bar K_3, P_3, C_3, K_1+K_2 (4 graphs)
For n = 4: P_2+2K_1, P_3+K_1, C_3+K_1, K_{1,3}, \bar K_4, 2P_2, C+4, K_4 (8 graphs)
Here, the bar indicates the complement of a graph and + indicates a graph union (\cup).


CROSSREFS

Cf. A095424 (number of connected simple edgetransitive graphs on n vertices).
Sequence in context: A246850 A294066 A163489 * A076651 A081410 A217694
Adjacent sequences: A095349 A095350 A095351 * A095353 A095354 A095355


KEYWORD

nonn,more


AUTHOR

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


EXTENSIONS

Corrected (by including empty graphs), a(9)a(10) and comment added by Eric W. Weisstein, May 1112 2017
a(7)a(10) corrected and a(11)a(47) added by Lucas Mol, Mar 18 2019


STATUS

approved



