摘要
利用划分、求和再嵌套递推法研究了两类特殊图的完美匹配计数问题,给出了图3-nC6,3和3-nP2,4的完美匹配数的计算公式.所给出的方法可以计算出许多类图的所有完美匹配的数目,为图的完美匹配问题的应用提供了理论支持.
By the methods of partition,summation and then nested recursion,the perfect matching counting problem of two types of special graphs is studied.The formulas of the perfect matching numbers of the graphs 3-nC(6,3) and 3-nP(2,4) are given.By the method presented in this paper,the number of all perfect matchings of many graphs can be calculated.Therefore,this provides the theory support for the application of perfect matching in graph.
作者
唐保祥
任韩
TANG Bao-xiang;REN Han(School of Mathematics and Statistics,Tianshui Normal University,Tianshui 741001,China;Department of Mathematics,East China Normal University,Shanghai200062,China)
出处
《东北师大学报（自然科学版）》
CAS
北大核心
2019年第2期13-16,共4页
Journal of Northeast Normal University(Natural Science Edition)
基金
国家自然科学基金资助项目(11171114)
关键词
完美匹配
线性递推式
特征方程
perfect matching
linear recurrence relation
characteristic equation
