login
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

%I #4 Jun 24 2014 01:08:19

%S 4,69360,25181448044544,500282053019322336000000000,

%T 1364205042837678184255639132540659302400000000,

%U 1119704625219101611411719462621416231171361585800882437615771859939328

%N 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 NumberOfSpanningTrees(L(S_3 x S_3)) = 69360

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

%K nonn

%O 2,1

%A _Roberto E. Martinez II_, Jan 07 2002

%E Edited by _Dean Hickerson_, Jan 14, 2002