|
%I #22 Feb 17 2023 22:28:52
%S 16,45,75,209,336,928,1445,3965,6000,16555
%N Minimum number of spanning trees in a 3-connected graph on n nodes.
%C 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).
%H David Kofoed Wind, <a href="/A006290/a006290.pdf">Connected Graphs with Fewest Spanning Trees</a>, Bachelor Thesis, Spring 2011.
%e a(4) = 16 which is the number of spanning trees in the complete graph on 4 nodes.
%Y Cf. A006290 (3-connected graphs), A199676 (minimally 3-connected graphs).
%K nonn,more
%O 4,1
%A _David Kofoed Wind_, Jan 11 2023
| 