A324088 -id:A324088 - cp's OEIS frontend

A324424 Number of minimally 10-connected non-isomorphic n-vertex graphs.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 19, 2186

Offset: 1

Jens M. Schmidt, Mar 03 2019

Jens M. Schmidt, Data files in graph6 format

Cf. A324418, A324423.

A052444 Number of simple unlabeled n-node graphs of connectivity 3.

Original entry on oeis.org

0, 0, 0, 1, 2, 13, 111, 2004, 66410, 3902344, 388624106, 65142804740

Offset: 1

Eric W. Weisstein

Jens M. Schmidt, Data files in graph6 format
Eric Weisstein's World of Mathematics, k-Connected Graph.

Column k=3 of A259862.

Cf. A000719, A006290, A052442, A052443, A052445, A086216.

a(n) = A006290(n) - A086216(n). - Andrew Howroyd, Sep 04 2019

Name edited and a(8)-a(11) by Jens M. Schmidt, Feb 18 2019
a(3)-a(4) corrected by Andrew Howroyd, Aug 28 2019
a(12) from Sean A. Irvine, Nov 28 2021

A086217 Number of 5-connected graphs on n nodes.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 4, 39, 1051, 102630, 22331311, 8491843895

Offset: 1

Eric W. Weisstein, Jul 12 2003

Travis Hoppe and Anna Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
Jens M. Schmidt, Data files in graph6 format
Eric Weisstein's World of Mathematics, k-Connected Graph

Cf. A002218, A052443, A052445, A086216, A259862, A324234, A324240.

a(n) = A324240(n) + A324234(n). - Andrew Howroyd, Sep 04 2019

a(n) = A086216(n) - A052445(n). - Jean-François Alcover, Sep 13 2019, after Andrew Howroyd in A086216

Offset corrected by Travis Hoppe, Apr 11 2014
a(10) from the Encyclopedia of Finite Graphs (Travis Hoppe and Anna Petrone), Apr 11 2014
a(11) by Jens M. Schmidt, Feb 20 2019
a(12) added by Georg Grasegger, Jan 07 2025

A324089 Number of simple non-isomorphic n-vertex graphs of connectivity 8.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 1, 5, 121, 32960, 75032363, 345212067543

Offset: 1

Jens M. Schmidt, Feb 15 2019

Jens M. Schmidt, Data files in graph6 format

Column k=9 of A259862.

Cf. A259862, A052445.

geng $n -d8 -c | countg -G8 # Georg Grasegger, Jan 07 2025

a(13) added by Brendan McKay, Sep 01 2023

a(14) added by Georg Grasegger, Jan 07 2025

A324090 Number of simple non-isomorphic n-vertex graphs of connectivity 9.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 5, 179, 113778, 814270066

Offset: 1

Jens M. Schmidt, Feb 15 2019

Jens M. Schmidt, Data files in graph6 format

Cf. A259862, A052445.

a(14) added by Brendan McKay, Sep 01 2023

A324092 Number of 7-connected simple non-isomorphic n-vertex graphs.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 5, 87, 9940, 7532629, 12213260468

Offset: 1

Jens M. Schmidt, Feb 15 2019

Jens M. Schmidt, Data files in graph6 format
Eric Weisstein's World of Mathematics, k-Connected Graph

Cf. A259862, A086216, A259862, A324088, A324093.

a(n) = A324093(n) + A324088(n). - Andrew Howroyd, Sep 04 2019

a(13) added by Georg Grasegger, Jan 07 2025

A324093 Number of 8-connected simple non-isomorphic n-vertex graphs.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 1, 6, 127, 33146, 75146405, 346026751657

Offset: 1

Jens M. Schmidt, Feb 15 2019

Jens M. Schmidt, Data files in graph6 format

Cf. A259862, A086216, A259862, A324089, A324094.

a(n) = A324094(n) + A324089(n). - Andrew Howroyd, Sep 04 2019

a(13)-a(14) added by Georg Grasegger, Jan 07 2025

A324094 Number of 9-connected simple non-isomorphic n-vertex graphs.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 6, 186, 114042, 814684114

Offset: 1

Jens M. Schmidt, Feb 15 2019

Jens M. Schmidt, Data files in graph6 format

Cf. A259862, A086216, A259862, A324090, A324095.

a(n) = A324095(n) + A324090(n). - Andrew Howroyd, Sep 04 2019

a(14) added by Georg Grasegger, Jan 07 2025

A324095 Number of 10-connected simple non-isomorphic n-vertex graphs.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 7, 264, 414048, 9508367572

Offset: 1

Jens M. Schmidt, Feb 15 2019

Jens M. Schmidt, Data files in graph6 format

Cf. A259862, A086216.

a(15) added by Georg Grasegger, Jan 07 2025

A324227 Number of simple 4-edge-connected non-isomorphic n-vertex graphs.

Original entry on oeis.org

0, 0, 0, 0, 1, 4, 29, 424, 15471, 1249951, 187095386, 48211082866

Offset: 1

Jens M. Schmidt, Feb 18 2019

Jens M. Schmidt, Data files in graph6 format

Cf. A007146, A052447.

a(12) added by Georg Grasegger, Jan 07 2025

cp's OEIS Frontend

A324424 Number of minimally 10-connected non-isomorphic n-vertex graphs.

Views

Author

Keywords

Links

Crossrefs

A052444 Number of simple unlabeled n-node graphs of connectivity 3.

Views

Author

Keywords

Links

Crossrefs

Formula

Extensions

A086217 Number of 5-connected graphs on n nodes.

Views

Author

Keywords

Links

Crossrefs

Formula

Extensions

A324089 Number of simple non-isomorphic n-vertex graphs of connectivity 8.

Views

Author

Keywords

Links

Crossrefs

Programs

nauty

Extensions

A324090 Number of simple non-isomorphic n-vertex graphs of connectivity 9.

Views

Author

Keywords

Links

Crossrefs

Extensions

A324092 Number of 7-connected simple non-isomorphic n-vertex graphs.

Views

Author

Keywords

Links

Crossrefs

Formula

Extensions

A324093 Number of 8-connected simple non-isomorphic n-vertex graphs.

Views

Author

Keywords

Links

Crossrefs

Formula

Extensions

A324094 Number of 9-connected simple non-isomorphic n-vertex graphs.

Views

Author

Keywords

Links

Crossrefs

Formula

Extensions

A324095 Number of 10-connected simple non-isomorphic n-vertex graphs.

Views

Author

Keywords

Links

Crossrefs

Extensions

A324227 Number of simple 4-edge-connected non-isomorphic n-vertex graphs.

Views

Author

Keywords

Links

Crossrefs

Extensions