|
| |
|
|
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
| | |
|
|
|
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 * A162027 A172616 A172798
Adjacent sequences: A066540 A066541 A066542 * 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
|
| |
|
|
