2类图完美匹配计数公式的嵌套递推求法  

Two Types of Nested Recursive Methods for Finding Counting Formulas of Perfect Matching Number

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

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

出　　处：《西南师范大学学报（自然科学版）》2019年第8期23-27,共5页Journal of Southwest China Normal University(Natural Science Edition)

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

摘　　要：把图2-nD8和2-nD6的完美匹配按饱和某个顶点的完美匹配进行分类,求出每一类完美匹配数目的递推关系式,再利用这些递推式之间的相互关系,得到这两类图的完美匹配数目的递推关系式,最后从递推式中解出这两类图的完美匹配数目的计算公式.The perfect matching of graphs 2-nD 8 and 2-nD 6 has been classified according to the perfect matching of a certain vertex of saturation, and the recursive relation of each kind of perfect matching number been obtained. Then the interrelationship between these recursive formulas has been used to eliminate those that are not needed. The recursive relation has been used to obtain the recursive relation of the perfect matching number of the two kinds of graphs. Finally, the formula for calculating the perfect matching number of the two graphs has been solved from the recursive formula.

关 键 词：完美匹配 线性递推式 特征方程 通解 

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