摘要
用划分、求和再递推的方法分别给出了图3-n3LC4,3-nBC4,3-nL4和1-nXC4的完美匹配数目的计算公式,所给出的方法可以计算出许多特殊图的所有完美匹配的数目.并利用所得到的计算公式计算出了一类图的Hamilton圈的数目.
The calculating formula of the perfect matching for graphs 3 - n3LC4,3 - rtBC4, 3 - nL4 and 1 - nXC4 is made by applying differentiation, summation and re-recursion. By the method presented in this paper, the numbers of all perfect matchings of many particular graphs can be calculated. The number of Hamilton cycles of some graphs has been calculated.
出处
《华南师范大学学报(自然科学版)》
CAS
北大核心
2014年第1期17-21,共5页
Journal of South China Normal University(Natural Science Edition)
基金
国家自然科学基金项目(11171114)
关键词
完美匹配
线性递推式
特征方程
HAMILTON圈
perfect matching
linear recurrence relation
characteristic equation
Hamilton cycle