Perfect matchings in random octagonal chain graphs (Q2230025)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect matchings in random octagonal chain graphs |
scientific article |
Statements
Perfect matchings in random octagonal chain graphs (English)
0 references
17 September 2021
0 references
Summary: A perfect matching of a (molecule) graph \(G\) is a set of independent edges covering all vertices in \(G\). 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.
0 references
