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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066544 Number of spanning trees in the line graph of the product of two star graphs, each of order n, L(S_n x S_n). 0
4, 69360, 25181448044544, 500282053019322336000000000, 1364205042837678184255639132540659302400000000, 1119704625219101611411719462621416231171361585800882437615771859939328 (list; graph; refs; listen; history; internal format)
OFFSET

2,1

EXAMPLE

NumberOfSpanningTrees(L(S_3 x S_3)) = 69360

MATHEMATICA

NumberOfSpanningTrees[LineGraph[GraphProduct[Star[n], Star[n]]]] (* First load package DiscreteMath`Combinatorica` *)

CROSSREFS

Sequence in context: A165812 A074318 A102200 * A009529 A193151 A034209

Adjacent sequences:  A066541 A066542 A066543 * A066545 A066546 A066547

KEYWORD

nonn

AUTHOR

Roberto E. Martinez II (remartin(AT)fas.harvard.edu), Jan 07 2002

EXTENSIONS

Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jan 14, 2002

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 15 21:56 EST 2012. Contains 205860 sequences.