A066543 Number of spanning trees in the line graph of the product of two cycle graphs, each of order n, L(C_n x C_n).

782757789696, 5976745079881894723584, 29514790517935282585600000000000000, 95296975201657487970461602120230307486331043840000, 202142993853936783750487849288950496428731602354031286611374533246976

Offset: 3

Author

Roberto E. Martinez II, Jan 07 2002

Keywords

• nonn

Examples

			NumberOfSpanningTrees(L(C_3 x C_3)) = 782757789696
		

Crossrefs

Cf. A212800.

Programs

Mathematica

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

Formula

a(n) = 2^(3*n^2-1) * A212800(n). - Sean A. Irvine, Oct 25 2023

Extensions

Edited by Dean Hickerson, Jan 14 2002

a(7) from Sean A. Irvine, Oct 25 2023