|
| |
|
|
A028466
|
|
Number of perfect matchings in graph C_{3} X C_{5} X P_{2n}.
|
|
0
|
|
|
|
1, 106784, 56850678464, 32898111133723321, 19096119789145305208336, 11085838411090123868197412129, 6435670258948861016802884153464799, 3736105167546089403361511734752297982336, 2168924345573542197211153077794030841411079321
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
Per Hakan Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", Research report, No 12, 1996, Department of Math., Umea University, Sweden.
|
|
|
LINKS
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
