| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8900634 | Applied Mathematics and Computation | 2018 | 9 Pages |
Abstract
Enumeration of perfect matchings in general graphs (even in bipartite graphs) is #P-complete. In this paper, we obtain explicit expressions of the number of perfect matchings of 8.6.4 lattices with toroidal boundary by enumerating Pfaffians.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Xing Feng, Lianzhu Zhang, Mingzu Zhang,