The Number of Perfect Matchings in Hexagons on the Torus by Pfaffians
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.
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/4120166 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|