Enumeration of perfect matchings of lattice graphs by Pfaffians

Xing Feng, Lianzhu Zhang and Mingzu Zhang

Applied Mathematics and Computation, 2018, vol. 338, issue C, 412-420

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: Perfect matching; 8.6.4 lattice graph; Pfaffian graph; Toroidal boundary (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318305150
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:338:y:2018:i:c:p:412-420

DOI: 10.1016/j.amc.2018.06.027

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().