A359704 Minimum number of spanning trees in a 3-connected graph on n nodes.

16, 45, 75, 209, 336, 928, 1445, 3965, 6000, 16555

Offset

4,1

Comments

The initial terms were found through generating all minimally 3-connected graphs with n vertices for n up to 13 (the 3-connected graphs with fewest spanning trees are minimally 3-connected).

Links

Table of n, a(n) for n=4..13.

David Kofoed Wind, Connected Graphs with Fewest Spanning Trees, Bachelor Thesis, Spring 2011.

Example

a(4) = 16 which is the number of spanning trees in the complete graph on 4 nodes.

Crossrefs

Cf. A006290 (3-connected graphs), A199676 (minimally 3-connected graphs).

Sequence in context: A192143 A221593 A300962 * A051868 A209993 A322343

Adjacent sequences: A359701 A359702 A359703 * A359705 A359706 A359707

Keyword

nonn,more

Author

David Kofoed Wind, Jan 11 2023

Status

approved