Minimum number of spanning trees in a 3-connected graph on n nodes.
A359704
Minimum number of spanning trees in a 3-connected graph on n nodes.
Terms
- a(0) =16a(1) =45a(2) =75a(3) =209a(4) =336a(5) =928a(6) =1445a(7) =3965a(8) =6000a(9) =16555
External references
- oeis: A359704