两类图中完美匹配数的递推求法  

Recursive method for perfect matching number in two types of graphs

作　　者：唐保祥[1] 任韩[2] TANG Baoxiang;REN Han(School of Mathematics and Statistics Institute,Tianshui Normal University,Tianshui,Gansu 741001,China;Department of Mathematics,East China Normal University,Shanghai 200062,China)

机构地区：[1]天水师范学院数学与统计学院,甘肃天水741001 [2]华东师范大学数学系,上海200062

出　　处：《华中师范大学学报（自然科学版）》2020年第1期12-16,共5页Journal of Central China Normal University：Natural Sciences

基　　金：国家自然科学基金项目(11171114)

摘　　要：该文针对两类特殊图2-nP和2-nC6,4,利用匹配顶点分类的方法,建立了两类图完美匹配数的递推关系式,并且解出了递推式的通解,从而得到了这两类图的完美匹配数目的计算公式.In this paper, for two types of special graphs 2-nP and 2-nC6,4, the recursive relation between two types of graph perfect matching numbers is established by using matching vertex classification method, and the recursive general solution is solved. An explicit formula for the perfect matching number of these two types of graphs is obtained.

关 键 词：完美匹配 分类 递推式关系 通解 

分 类 号：O157.5[理学—数学]