How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs
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.
scientific article; zbMATH DE number 89908
scientific article