A052447 Number of simple unlabeled n-node graphs of edge-connectivity 2.

0, 0, 1, 2, 8, 41, 352, 4820, 113256, 4602039, 325754696, 40348545658

Offset

1,4

Links

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

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=2 of A263296.

Cf. other unlabeled edge-connectivity graph sequences A052446, A052448, A241703, A241704, A241705.

Sequence in context: A136281 A125698 A231495 * A226458 A364383 A330870

Adjacent sequences: A052444 A052445 A052446 * A052448 A052449 A052450

Keyword

nonn,hard,more

Author

Eric W. Weisstein, May 08 2000

Extensions

a(8)-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