The Number of Perfect Matchings in Hexagons on the Torus by Pfaffians

Abstract

Let G be a (molecular) graph. A perfect matching of G is defined as a set of edges which are independent and cover every vertex of G exactly once. In the article, we present the formula on the number of the perfect matchings of two types of hexagons on the torus by Pfaffians.