A066545 Number of spanning trees in the line graph of the product of two complete graph, each of order n, L(K_n x K_n).

4, 782757789696, 391497025772177207236260602767731880976449536, 79571717825565862744861159703491334416072984127575634790474236302905519522005340085288960000000000000000000000

Offset

2,1

Comments

a(2) = 2^2, a(3) = 2^30 * 3^6, a(4) = 2^99 * 3^31, a(5) = 2^314 * 5^22. - Gerald McGarvey, Oct 20 2007

Links

Table of n, a(n) for n=2..5.

Example

NumberOfSpanningTrees(L(K_2 x K_2)) = 4.

Mathematica

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

Crossrefs

Sequence in context: A034250 A058436 A067501 * A161405 A147876 A164796

Adjacent sequences: A066542 A066543 A066544 * A066546 A066547 A066548

Keyword

hard,nonn

Author

Roberto E. Martinez II, Jan 07 2002

Extensions

Edited by Dean Hickerson, Jan 14, 2002

Status

approved