|
%I #8 Jan 17 2020 03:30:15
%S 16,81,392,2000,9800,50421,248832,1265625,6422000,32710656
%N Maximum number of spanning trees in a cubic graph on 2n vertices.
%C a(5) = 2000 is realized by Petersen graph, a(7) = 50421 is realized by the Heawood graph.
%e When n=2, the only cubic graph on 2n vertices is the complete graph K4 with 16 spanning trees.
%Y Cf. A020871.
%K nonn,more
%O 2,1
%A _Gordon F. Royle_, Jul 20 2005
|
