Open AccessPerfect Matchings in Random Octagonal Chain Graphs
Author(s) -
Shouliu Wei,
Niandong Chen,
Xiaoling Ke,
Guoliang Hao,
Huang Jian-wu
Publication year - 2021
Publication title -
journal of mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.252
H-Index - 13
eISSN - 2314-4785
pISSN - 2314-4629
DOI - 10.1155/2021/2324632
Subject(s) - mathematics , combinatorics , matching (statistics) , discrete mathematics , set (abstract data type) , graph , chain (unit) , statistics , computer science , physics , astronomy , programming language
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom