login
The OEIS is supported by the many generous donors 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; text; internal format)
OFFSET
2,1
LINKS
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: A102200 A257769 A370683 * A009529 A339450 A273231
KEYWORD
nonn
AUTHOR
EXTENSIONS
Edited by Dean Hickerson, Jan 14, 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 05:19 EDT 2024. Contains 371782 sequences. (Running on oeis4.)