A364404 -id:A364404 - cp's OEIS frontend

A204198 Number of (strictly) 3-connected cubic graphs on 2n nodes.

Original entry on oeis.org

0, 1, 2, 4, 14, 57, 341, 2828, 30468, 396150, 5909292, 98101019, 1782392646, 35085504243

Offset: 1

N. J. A. Sloane, Jan 12 2012

G. Brinkmann, J. Goedgebeur and B. D. McKay, snarkhunter.
F. C. Bussemaker, S. Cobeljic, L. M. Cvetkovic and J. J. Seidel, Computer investigations of cubic graphs, T.H.-Report 76-WSK-01, Technological University Eindhoven, Dept. Mathematics, 1976.
J. P. Costalonga, R. J. Kingan, and S. R. Kingan, Constructing minimally 3-connected graphs, arXiv:2012.12059 [math.CO], 2020-2021; Algorithms 14, no. 1: 9.

Cf. A002851, A204199, A364404.

a(8)-a(10) from S. R. Kingan, Jan 08 2021

a(11)-a(14) from Ed Wynn, Jul 22 2023

A204199 Number of (strictly) 2-connected cubic graphs on 2n nodes.

Original entry on oeis.org

0, 0, 0, 1, 4, 24, 139, 1046, 9398, 101668, 1278335, 18248616, 290147706, 5071909933

Offset: 1

N. J. A. Sloane, Jan 12 2012

The snarkhunter program (see Links) has options "C2" and "C3" for (at least) 2- and 3-connectivity respectively. So a(n) is the difference between the outputs from "./snarkhunter X 3 n C2" and "./snarkhunter X 3 n C3", where X=2n. - Ed Wynn, Jul 22 2023

			From _Ed Wynn_, Jul 22 2023: (Start)
For n=4, the unique 8-node cubic graph that is strictly 2-connected is:
   o-o
  /| |\
 o-o o-o
  \| |/
   o-o
(End)

G. Brinkmann, J. Goedgebeur and B. D. McKay, snarkhunter.
F. C. Bussemaker, S. Cobeljic, L. M. Cvetkovic and J. J. Seidel, Computer investigations of cubic graphs, T.H.-Report 76-WSK-01, Technological University Eindhoven, Dept. Mathematics, 1976.

Cf. A002851, A204198, A364404.

a(8)-a(14) from Ed Wynn, Jul 22 2023

cp's OEIS Frontend

A204198 Number of (strictly) 3-connected cubic graphs on 2n nodes.

Views

Author

Keywords

Links

Crossrefs

Extensions