A108941 Maximum number of spanning trees in a cubic graph on 2n vertices.

16, 81, 392, 2000, 9800, 50421, 248832, 1265625, 6422000, 32710656

Offset

2,1

Comments

a(5) = 2000 is realized by Petersen graph, a(7) = 50421 is realized by the Heawood graph.

Links

Table of n, a(n) for n=2..11.

Example

When n=2, the only cubic graph on 2n vertices is the complete graph K4 with 16 spanning trees.

Crossrefs

Cf. A020871.

Sequence in context: A343324 A360906 A343284 * A377022 A153157 A369168

Adjacent sequences: A108938 A108939 A108940 * A108942 A108943 A108944

Keyword

nonn,more

Author

Gordon F. Royle, Jul 20 2005

Status

approved