login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108941 Maximum number of spanning trees in a cubic graph on 2n vertices. 0
16, 81, 392, 2000, 9800, 50421, 248832, 1265625, 6422000, 32710656 (list; graph; refs; listen; history; internal format)
OFFSET

2,1

COMMENTS

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: A187457 A056118 A134606 * A153157 A113849 A046453

Adjacent sequences:  A108938 A108939 A108940 * A108942 A108943 A108944

KEYWORD

nonn

AUTHOR

Gordon Royle (gordon(AT)maths.uwa.edu.au), Jul 20 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 17:48 EST 2012. Contains 205939 sequences.