2类图完美匹配数按匹配顶点分类的递推求法  

Perfect Matching Number of Two Kinds of Graphs Based on Recursive Method of Matching Vertex Classification

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

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

出　　处：《吉林大学学报（理学版）》2020年第2期309-313,共5页Journal of Jilin University:Science Edition

基　　金：国家自然科学基金(批准号:11171114).

摘　　要：先把图3-nY4和3-nC6,3的完美匹配按饱和某个顶点的完美匹配进行分类,得到一组有相互联系的递推关系式,再由这组递推式间的关系给出这两类图完美匹配数的计算公式。First,the perfect matching of graphs 3-nY4 and 3-nC6,3 was classified according to the perfect matching of a certain vertex,we obtained a set of recursive formulas which were related to each other.Then,the formula for calculating the perfect matching number of these two kinds of graphs was derived from the relationship between the recursive formulas.

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

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