A perfect matching of a (molecule) graph is a set of independent edges covering all vertices in . In this paper, we establish a simple formula for the expected value of the number of perfect matchings in random octagonal chain graphs and present the asymptotic behavior of the expectation.

中文翻译：

---

随机八边形链图中的完美匹配

一个（分子）图的完美匹配是一组独立的边，覆盖了 中的所有顶点。在本文中，我们建立了随机八边形链图中完美匹配数的期望值的简单公式，并给出了期望的渐近行为。