|
| |
|
|
A028461
|
|
Number of perfect matchings in graph P_{3} X C_{4} X P_{n}.
|
|
1
|
|
|
|
1, 32, 6345, 862112, 127027769, 18434590176, 2684514068049, 390673621254528, 56862963807949489, 8276224228029314656, 1204586814571431439961, 175324813971551693097120, 25518128187364758678417065, 3714105333409502557299108768, 540579565559752815170611323297
(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
|
|
|
|
STATUS
|
approved
|
| |
|
|
