|
Search: id:A066544
|
|
|
| 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
1
|
|
| 4, 69360, 25181448044544, 500282053019322336000000000, 1364205042837678184255639132540659302400000000, 1119704625219101611411719462621416231171361585800882437615771859939328
(list; graph; listen)
|
|
|
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
|
Adjacent sequences: A066541 A066542 A066543 this_sequence A066545 A066546 A066547
Sequence in context: A046882 A074318 A102200 this_sequence A009529 A034209 A058430
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roberto E. Martinez II (remartin(AT)fas.harvard.edu), Jan 07 2002
|
|
EXTENSIONS
|
Edited by Dean Hickerson (dean(AT)math.ucdavis.edu), Jan 14, 2002
|
|
|
Search completed in 0.002 seconds
|
