|
| |
|
|
A033532
|
|
Number of matchings in graph C_{4} X C_{4} X P_{n}.
|
|
1
|
|
|
|
1, 41025, 13803794944, 3952450882750401, 1149377449671217283137, 333818434084936656186187776, 96963347585045688551801772350785, 28164412862777096850129871275625835649, 8180769830636914759269721968659872494731776, 2376225290581931684771439975937521777947501317377
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
COMMENTS
|
|
|
|
REFERENCES
|
Per Hakan Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", Research reports, No 12, 1996, Department of Mathematics, Umea University.
|
|
|
LINKS
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
