login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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: A102200 A257769 A370683 * A009529 A339450 A273231
KEYWORD
nonn
AUTHOR
EXTENSIONS
Edited by Dean Hickerson, Jan 14, 2002
STATUS
approved