Perfect Matchings in Random Octagonal Chain Graphs

Shouliu Wei; Niandong Chen; Xiaoling Ke; Guoliang Hao; Jianwu Huang

doi:10.1155/2021/2324632

Journal of Mathematics (Jan 2021)

Perfect Matchings in Random Octagonal Chain Graphs

Shouliu Wei,
Niandong Chen,
Xiaoling Ke,
Guoliang Hao,
Jianwu Huang

Affiliations

Shouliu Wei: College of Mathematics and Data Science, Minjiang University, Fuzhou, Fujian 350108, China
Niandong Chen: New Huadu Business School, Minjiang University, Fuzhou, Fujian 350108, China
Xiaoling Ke: College of Mathematics and Data Science, Minjiang University, Fuzhou, Fujian 350108, China
Guoliang Hao: College of Science, East China University of Technology, Nanchang, Jiangxi 330013, China
Jianwu Huang: College of Mathematics and Data Science, Minjiang University, Fuzhou, Fujian 350108, China

DOI: https://doi.org/10.1155/2021/2324632
Journal volume & issue: Vol. 2021

Abstract

Read online

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.

Published in Journal of Mathematics

ISSN: 2314-4629 (Print); 2314-4785 (Online)
Publisher: Wiley
Country of publisher: United Kingdom
LCC subjects: Science: Mathematics
Website: https://onlinelibrary.wiley.com/journal/1469

About the journal