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:
Bibliographic Details
Published inJournal of mathematics (Hidawi) Vol. 2021; pp. 1 - 5
Main Authors Wei, Shouliu, Chen, Niandong, Ke, Xiaoling, Hao, Guoliang, Huang, Jianwu
Format Journal Article
LanguageEnglish
Published Cairo Hindawi 2021
Hindawi Limited
Wiley
Subjects
Apexes
Applied mathematics
Asymptotic properties
Chains
Combinatorics
Expected values
Graph matching
Graph theory
Graphs
Hydrocarbons
Mathematics
Organic chemistry
Probability
Random variables
Statistical physics
Fujian China
China
Online AccessGet full text

Cover

More Information
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.
ISSN:2314-4629
2314-4785
DOI:10.1155/2021/2324632