2类图完美对集数的计算公式  

On Calculation Formula for Perfect Matching Number of Two Types of Graphs

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

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

出　　处：《西南师范大学学报（自然科学版）》2020年第10期13-15,共3页Journal of Southwest China Normal University(Natural Science Edition)

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

摘　　要：把图N_(mn)和3-nK_(3,3)的完美对集按关联某个顶点的边进行分类,求出每一类完美对集数目的递推关系式,再用求和与嵌套递推的方法,给出了图N_(mn)和3-nK_(3,3)的不同完美对集的计数公式为2~n和6~n.The perfect matchings of graphs N mn and 3-nK 3,3 have been classified according to the edge associated with a vertex,and the recurrence relationship of the number of perfect matchings of each type been obtained,and then the sum and nested recursion methods been used to give the counting formulas for the different perfect matchings in graphs N mn and 3-nK 3,3 are 2 n and 6 n.

关 键 词：分类 完美对集 递推式 

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