|
Search: id:A066545
|
|
|
| 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). |
|
+0
2
|
|
| 4, 782757789696, 391497025772177207236260602767731880976449536, 79571717825565862744861159703491334416072984127575634790474236302905519522005340085288960000000000000000000000
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
a(2) = 2^2, a(3) = 2^30 * 3^6, a(4) = 2^99 * 3^31, a(5) = 2^314 * 5^22 - Gerald McGarvey (gerald.mcgarvey(AT)comcast.net), Oct 20 2007
|
|
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 this_sequence A004231 A066546 A132653
Adjacent sequences: A066542 A066543 A066544 this_sequence A066546 A066547 A066548
|
|
KEYWORD
|
hard,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
|
