login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052447 Number of simple unlabeled n-node graphs of edge-connectivity 2. 19
0, 0, 1, 2, 8, 41, 352, 4820, 113256, 4602039, 325754696, 40348545658 (list; graph; refs; listen; history; text; internal format)
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 A330870 A342152

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 22:12 EST 2021. Contains 349435 sequences. (Running on oeis4.)