login
This site is supported by donations to The OEIS Foundation.

 

Logo

The October issue of the Notices of the Amer. Math. Soc. has an article about the OEIS.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052447 Number of simple 2-edge-connected unlabeled n-node graphs. 7
0, 0, 1, 2, 8, 41, 352, 4820, 113256, 4602039 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

Eric Weisstein's World of Mathematics, k-Edge-Connected Graph.

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, 2014

CROSSREFS

Cf. other k-edge-connected unlabeled graph sequences A052446, A052447, A052448, A241703, A241704, A241705.

Sequence in context: A136281 A125698 A231495 * A226458 A153537 A153565

Adjacent sequences:  A052444 A052445 A052446 * A052448 A052449 A052450

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

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 15:16 EDT 2018. Contains 315270 sequences. (Running on oeis4.)