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
A199676
Number of minimally 3-connected non-isomorphic graphs on n vertices.
Original entry on oeis.org
1, 1, 3, 5, 18, 57, 285, 1513, 9824, 69536, 540622, 4494676
Offset: 4
- 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.
- Jens M. Schmidt, Combinatorial data.
- David Kofoed Wind, Connected Graphs with Fewest Spanning Trees, Bachelor Thesis, Spring 2011.
A324423
Number of minimally 9-connected non-isomorphic n-vertex graphs.
Original entry on oeis.org
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 15, 908, 912344
Offset: 1
A324419
Number of minimally 5-connected non-isomorphic n-vertex graphs.
Original entry on oeis.org
0, 0, 0, 0, 0, 1, 1, 5, 26, 397, 9240, 346234
Offset: 1
A324420
Number of minimally 6-connected non-isomorphic n-vertex graphs.
Original entry on oeis.org
0, 0, 0, 0, 0, 0, 1, 1, 7, 57, 2206, 162374
Offset: 1
A324421
Number of minimally 7-connected non-isomorphic n-vertex graphs.
Original entry on oeis.org
0, 0, 0, 0, 0, 0, 0, 1, 1, 10, 133, 14370
Offset: 1
A324422
Number of minimally 8-connected non-isomorphic n-vertex graphs.
Original entry on oeis.org
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 11, 320, 108300
Offset: 1
Showing 1-7 of 7 results.