|
Search: id:A108941
|
|
|
| A108941 |
|
Maximum number of spanning trees in a cubic graph on 2n vertices. |
|
+0
1
|
|
| 16, 81, 392, 2000, 9800, 50421, 248832, 1265625, 6422000, 32710656
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
a(5) = 2000 is realized by Petersen graph, a(7) = 50421 is realized by the Heawood graph
|
|
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: A113317 A056118 A134606 this_sequence A153157 A113849 A046453
Adjacent sequences: A108938 A108939 A108940 this_sequence A108942 A108943 A108944
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gordon Royle (gordon(AT)maths.uwa.edu.au), Jul 20 2005
|
|
|
Search completed in 0.002 seconds
|
