摘要
用划分,求和,再嵌套递推的方法给出了4类图完美匹配数目的显式表达式,利用所给出的方法可以计算出相同结构重复出现的许多图的所有完美匹配的数目.
In this paper, by applying differentiation, summation and re-nested recursive calculation, several countformulas of the perfect matching for four specific types of graphs are given. By the method presented in this paper, number of all perfect matchings of many graphs with the repeated same structure can be calculated.
出处
《武汉大学学报(理学版)》
CAS
CSCD
北大核心
2012年第5期441-446,共6页
Journal of Wuhan University:Natural Science Edition
基金
国家自然科学基金资助项目(11171114)
关键词
完美匹配
线性递推式
六角系统
perfect matching
recurrence relation
hexagonal system