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

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086216 Number of 4-connected unlabeled n-node graphs. 2
0, 0, 0, 0, 1, 4, 25, 384, 14480, 1211735 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

COMMENTS

The definition means that the connectivity is 4 or more.

LINKS

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

T. Hoppe and A. Petrone,Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014

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

EXAMPLE

There are 4 different 4-connected graphs on 6 vertices. - Dylan Thurston, Jun 18 2009

CROSSREFS

See A052445 for another (apparently incorrect, as of Jul 08 2015) version.

See A259862 for further information.

Sequence in context: A259591 A093959 A222902 * A167041 A123129 A075577

Adjacent sequences:  A086213 A086214 A086215 * A086217 A086218 A086219

KEYWORD

nonn,hard,more

AUTHOR

Eric W. Weisstein, Jul 12 2003

EXTENSIONS

Offset corrected by Dylan Thurston, Jun 18 2009.

a(10) from the Encyclopedia of Finite Graphs (Travis Hoppe and Anna Petrone), Apr 11 2014

Minor edits by N. J. A. Sloane, Jul 08 2015 at the suggestion of Brendan McKay. a(11) could be obtained from the data in A259862.

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 May 25 16:02 EDT 2017. Contains 287039 sequences.