Abstract
Enumeration of perfect matchings on graphs has a longstanding interest in combinatorial mathematics. In this paper, we obtain some explicit expressions of the number of perfect matchings for a type of Archimedean lattices with toroidal boundary by applying Tesler's crossing orientations to obtain some Pfaffian orientations and enumerating their Pfaffians.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have