|
|
A028460
|
|
Number of perfect matchings in graph P_{3} X C_{3} X P_{2n}.
|
|
1
|
|
|
1, 444, 440693, 471163403, 508635101004, 549900748355911, 594654671638397671, 643075325593489894332, 695442956730066504782459, 752075788532628446524005125, 813320598084518693275523115756, 879552861931742201382115765976449, 951178713466776585241143064515946177
(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
|
|
|
FORMULA
|
G.f.: see link above.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|