Enumeration of perfect matchings of a type of Cartesian products of graphs (Q2581564): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0511316 / rank | |||
Normal rank | |||
Revision as of 07:15, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumeration of perfect matchings of a type of Cartesian products of graphs |
scientific article |
Statements
Enumeration of perfect matchings of a type of Cartesian products of graphs (English)
0 references
10 January 2006
0 references
For a tree \(T\), the authors express the number of perfect matchings in the Cartesian products \(C_4\times T\), \(P_4\times T\) and \(P_3\times T\) (provided \(T\) itself has a perfect matching in this case) in terms of the eigenvalues of the adjacency matrix of \(T\).
0 references
Pfaffian orientation
0 references
adjacency matrix
0 references
