Enumeration of perfect matchings of a type of Cartesian products of graphs (Q2581564)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2244816
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration of perfect matchings of a type of Cartesian products of graphs |
scientific article; zbMATH DE number 2244816 |
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
0.8338267803192139
0 references
0.7909124493598938
0 references
0.7874056696891785
0 references
0.7817221879959106
0 references
