Perfect Matchings in Random Octagonal Chain Graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Perfect Matchings in Random Octagonal Chain Graphs

Published:2021-06-23 Issue: Volume:2021 Page:1-5
ISSN:2314-4785
Container-title:Journal of Mathematics
language:en
Short-container-title:Journal of Mathematics

Author:

Wei Shouliu¹^ORCID,Chen Niandong²^ORCID,Ke Xiaoling¹,Hao Guoliang³,Huang Jianwu¹

Affiliation:

1. College of Mathematics and Data Science, Minjiang University, Fuzhou, Fujian 350108, China

2. New Huadu Business School, Minjiang University, Fuzhou, Fujian 350108, China

3. College of Science, East China University of Technology, Nanchang, Jiangxi 330013, China

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.

Funder

National Natural Science Foundation of China

Publisher

Hindawi Limited

Subject

General Mathematics

Link

http://downloads.hindawi.com/journals/jmath/2021/2324632.pdf

Reference19 articles.

1. On the queen domination problem

2. A Graphical Model of a Class of Molecules

3. Kekulé structures and resonance energies of benzenoid hydrocarbons

4. Kekulé Structures in Benzenoid Hydrocarbons

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the number of perfect matchings in random polygonal chains;Open Mathematics;2023-01-01

2. The Counting of Perfect Matchings on Some Special Graphs;Pure Mathematics;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP