Perfect Matchings in Random Octagonal Chain Graphs
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.
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2021/2324632 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|