%I A066544
%S A066544 4,69360,25181448044544,500282053019322336000000000,
%T A066544 1364205042837678184255639132540659302400000000,
%U A066544 1119704625219101611411719462621416231171361585800882437615771859939328
%N 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).
%e A066544 NumberOfSpanningTrees(L(S_3 x S_3)) = 69360
%t A066544 NumberOfSpanningTrees[LineGraph[GraphProduct[Star[n], Star[n]]]] (* First 
               load package DiscreteMath`Combinatorica` *)
%Y A066544 Sequence in context: A165812 A074318 A102200 this_sequence A009529 A034209 
               A058430
%Y A066544 Adjacent sequences: A066541 A066542 A066543 this_sequence A066545 A066546 
               A066547
%K A066544 nonn
%O A066544 2,1
%A A066544 Roberto E. Martinez II (remartin(AT)fas.harvard.edu), Jan 07 2002
%E A066544 Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jan 14, 2002