摘要
图的完美匹配计数问题是匹配理论研究中的一个重要课题,此问题有很强的物理学和化学背景.但是,一般图的完美匹配计数问题却是NP-困难的.用划分、求和再递推的方法给出了3类图完美匹配数目的计算公式.所给出的方法,可以计算出许多二分图的所有完美匹配的数目.
It is an interesting and important problem to count the number of the perfect matchings in graphs,since it origins from both physics and chemistry.But the problem of counting the number of the perfect matchings for general graphs is NP-difficult.In this paper,by applying differentiation,summation and re-recursion calculation,several counting formulas of the perfect matching for three specific types of graphs are given.By the method presented in this paper,many bipartite graphs of the number of all perfect matchings can be calculated.
出处
《南京师大学报(自然科学版)》
CAS
CSCD
北大核心
2012年第1期16-21,共6页
Journal of Nanjing Normal University(Natural Science Edition)
基金
国家自然科学基金(11171114)
关键词
完美匹配
递推式
棋盘
perfect matching
recurrence relation
chessboard