How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs (Q1197034)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs |
scientific article; zbMATH DE number 89908
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs |
scientific article; zbMATH DE number 89908 |
Statements
How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs (English)
0 references
16 January 1993
0 references
By Kasteleyn's formula the number of perfect matchings in a plane graph \(G\) can be expressed by the determinant of a certain matrix related to the adjacency matrix of \(G\). In this paper a simplification is suggested which is very efficient for sections of certain infinite plane graphs.
0 references
enumeration
0 references
perfect matchings
0 references
plane graph
0 references
adjacency matrix
0 references
0 references
0.9046873
0 references
0.9035846
0 references
0.89381206
0 references
0.89237654
0 references
0.8912865
0 references
0.8896894
0 references
0.8896894
0 references
