|
|
A108941
|
|
Maximum number of spanning trees in a cubic graph on 2n vertices.
|
|
0
|
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
a(5) = 2000 is realized by Petersen graph, a(7) = 50421 is realized by the Heawood graph.
|
|
LINKS
|
|
|
EXAMPLE
|
When n=2, the only cubic graph on 2n vertices is the complete graph K4 with 16 spanning trees.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|