摘要
用划分、求和、递推的方法给出了2类偶图完美匹配数目的计算公式.利用所给出的方法,可以计算出许多偶图的所有完美匹配的数目.
In this paper,by applying differentiation,summation and re-recursion calculation,several formulas for counting the number of perfect matching for two types of bipartite graphs are given.By the method presented in this paper,the number of all perfect matchings for many bipartite graphs can be calculated.
出处
《西南大学学报(自然科学版)》
CAS
CSCD
北大核心
2012年第10期91-95,共5页
Journal of Southwest University(Natural Science Edition)
基金
国家自然科学基金资助项目(11171114)
关键词
线性递推式
六面体
棋盘
完美匹配
linear recurrence relation
hexahedron
chessboard
perfect matching