|
|
A028462
|
|
Number of perfect matchings in graph P_{3} X C_{5} X P_{2n}.
|
|
0
|
|
|
1, 29213, 3729856656, 550010117858551, 82488986661106452273, 12399477876511724386970911, 1864438246325261673678557608521, 280357398532807126891406612003534608, 42157883453596571760224856937456538736971, 6339368086045107439875364633706616894779758991
(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
|
|
|
|