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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052445 Number of simple exactly-4-connected unlabeled n-node graphs. 6
0, 0, 0, 1, 0, 3, 21 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

COMMENTS

This counts graphs whose connectivity is exactly 4. However, the numbers are not correct: the smallest 4-connected graph is the complete graph K_5, so the initial terms are incorrect. See A086216 and A259862 for more information. - N. J. A. Sloane, Jul 08 2015

LINKS

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

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

CROSSREFS

Cf. A052441, ..., A052445.

See A086216 for another version. See also A259862.

Sequence in context: A203314 A174652 A024011 * A229197 A188721 A212996

Adjacent sequences:  A052442 A052443 A052444 * A052446 A052447 A052448

KEYWORD

nonn,more

AUTHOR

Eric W. Weisstein

EXTENSIONS

Partially edited by N. J. A. Sloane, Jul 08 2015 at the suggestion of Brendan McKay

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 24 04:27 EDT 2017. Contains 292403 sequences.