login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A052448
Number of simple unlabeled n-node graphs of edge-connectivity 3.
6
0, 0, 0, 1, 2, 15, 121, 2159, 68715, 3952378, 389968005, 65161587084
OFFSET
1,5
LINKS
Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
Jens M. Schmidt, Combinatorial data.
Eric Weisstein's World of Mathematics, k-Edge Connected Graph.
CROSSREFS
Column k=3 of A263296.
Cf. other edge-connectivity unlabeled graph sequences A052446, A052447, A241703, A241704, A241705.
Sequence in context: A074621 A341929 A185758 * A168502 A369108 A127610
KEYWORD
nonn,hard,more
AUTHOR
Eric W. Weisstein, May 08 2000
EXTENSIONS
a(8), a(9), a(10) from the Encyclopedia of Finite Graphs by Travis Hoppe and Anna Petrone, Apr 22 2014
a(11) by Jens M. Schmidt, Feb 18 2019
a(12) from Jens M. Schmidt's web page, Jan 10 2021
STATUS
approved