南京师大学报（自然科学版）2016，Vol.39Issue(4)：1-4,4.DOI:10.3969/j.issn.1001-4616.2016.04.001
3类图完美匹配数目的计算公式
Counting Formulas of the Number of Perfect Matchings of the Three Types of Graphs
摘要
Abstract
Perfect matching counting problems graph has been proven to be NP-hard,so to get the number of perfectly matched general graph is very difficult.The issue has important applications in protein structure prediction,quantum chemistry,crystal physics and computer science.Research on this issue has very important theoretical and practical significance.The counting formula of the perfect matching for graphs 2-nT2,1-nDT2 and 3-nDT4 is made by applying differentiation,summation and re-recursion in this paper.By the method presented in this paper,the number of all perfect matchings of many graphs can be calculated.关键词
完美匹配/梯子/线性递推式/特征方程Key words
perfect matching/ladder/linear recurrence relation/characteristic equation分类
数理科学引用本文复制引用
唐保祥,任韩..3类图完美匹配数目的计算公式[J].南京师大学报（自然科学版）,2016,39(4):1-4,4.基金项目
国家自然科学基金(11171114). （11171114）
