Perfect Matchings in Random Octagonal Chain Graphs

Shouliu Wei, Niandong Chen, Xiaoling Ke, Guoliang Hao, Jianwu Huang and Niansheng Tang

Journal of Mathematics, 2021, vol. 2021, 1-5

Abstract: 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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/2324632.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/2324632.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:2324632

DOI: 10.1155/2021/2324632

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().