|
| |
|
|
A028467
|
|
Number of perfect matchings in graph C_{4} X C_{4} X P_{n}.
|
|
0
|
|
|
|
1, 272, 589185, 930336768, 1545853411969, 2551276235535120, 4215052025641922305, 6962828841161217269760, 11502121570585083415761153, 19000667589592082076903397136, 31387734017421172152812450818177, 51850272028503475884947837964718080
(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
|
| |
|
|
