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

Author

Gordon F. Royle, Jul 20 2005

Keywords

• nonn
• more

Comments

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

Examples

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

Crossrefs

Cf. A020871.