|
Search: id:A066543
|
|
|
| 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). |
|
+0
1
|
|
| 782757789696, 5976745079881894723584, 29514790517935282585600000000000000, 95296975201657487970461602120230307486331043840000
(list; graph; listen)
|
|
|
OFFSET
|
3,1
|
|
|
EXAMPLE
|
NumberOfSpanningTrees(L(C_3 x C_3)) = 782757789696
|
|
MATHEMATICA
|
NumberOfSpanningTrees[LineGraph[GraphProduct[Cycle[n], Cycle[n]]]] (* First load package DiscreteMath`Combinatorica` *)
|
|
CROSSREFS
|
Sequence in context: A092382 A017411 A017531 this_sequence A162027 A015433 A017184
Adjacent sequences: A066540 A066541 A066542 this_sequence A066544 A066545 A066546
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roberto E. Martinez II (remartin(AT)fas.harvard.edu), Jan 07 2002
|
|
EXTENSIONS
|
Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jan 14, 2002
|
|
|
Search completed in 0.002 seconds
|
