An infinite family of graphs with a facile count of perfect matchings (Q2636812)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An infinite family of graphs with a facile count of perfect matchings |
scientific article |
Statements
An infinite family of graphs with a facile count of perfect matchings (English)
0 references
18 February 2014
0 references
Cartesian product of graphs
0 references
\(k\)-matching
0 references
perfect matching
0 references
matching polynomial
0 references
permanent
0 references
contracted permanent
0 references
Hosoya index
0 references
degree sequence
0 references
immanant
0 references
