摘要
用划分,求和,再递推的方法给出了四类图完美匹配数目的显式表达式.所给方法可以计算出许多二分图所有完美匹配的数目.
By applying differentiation, summation and re - recursion calculation, several counting formulas of the perfect matchings for four specific types of graphs are given. Many bipartite graphs of the number of all perfect matchings can be calculated by the method presented in this paper.
出处
《福州大学学报(自然科学版)》
CAS
CSCD
北大核心
2012年第4期437-440,共4页
Journal of Fuzhou University(Natural Science Edition)
基金
国家自然科学基金资助项目(11171114)
关键词
图
完美匹配
线性递推式
特征方程
graph
perfect matching
linear recurrence relation
characteristic equation