福州大学学报（自然科学版）2012，Vol.40Issue(4)：437-440,4.
四类图完美匹配的计数公式
Counting formulas of the number of perfect matchings for four types of graphs
摘要
Abstract
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.关键词
图/完美匹配/线性递推式/特征方程Key words
graph/ perfect matching/ linear recurrence relation/ characteristic equation分类
数理科学引用本文复制引用
唐保祥,任韩..四类图完美匹配的计数公式[J].福州大学学报（自然科学版）,2012,40(4):437-440,4.基金项目
国家自然科学基金资助项目(11171114) （11171114）
