| 3类图完美匹配的数目 |
| |
| 引用本文： | 唐保祥,李刚,任韩.3类图完美匹配的数目[J].浙江大学学报(理学版),2011,38(4):387-390. |
| |
| 作者姓名： | 唐保祥 李刚 任韩 |
| |
| 作者单位： | 1. 天水师范学院数学与统计学院,甘肃天水741001;华东师范大学数学系,上海200062
2. 华东师范大学数学系,上海,200062 |
| |
| 基金项目： | 国家自然科学基金资助项目，上海市自然科学基金资助项目，上海市重点学科建设基金资助项目 |
| |
| 摘 要： | 图的完美匹配计数问题是匹配理论研究中的一个重要课题，此问题有很强的物理学和化学背景．但是，一般图的完关匹配计数问题却是NP-困难的．用划分、求和、再递推的方法给出了三类特殊图完美匹配数目的计算公式．
|
| 关 键 词： | 线性递推式 完美匹配 循环图 三棱锥 |
The number of perfect matching for three specific types of graphs |
| |
| TANG Bao-xiang,LI Gang,REN Han.The number of perfect matching for three specific types of graphs[J].Journal of Zhejiang University(Sciences Edition),2011,38(4):387-390. |
| |
| Authors: | TANG Bao-xiang LI Gang REN Han |
| |
| Institution: | 1.School of Mathematics and Statistics Institute,Tianshui Normal University,Tianshui 741001,Gansu Province,China;2.Department of Mathematics,East China Normal University,Shanghai 200062,China) |
| |
| Abstract: | It is an interesting and important problem that 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,the several counting formulas of the perfect matching for three specific types of graphs are given. |
| |
| Keywords: | linear recurrence relation perfect matching circulant graph triangular pyramid |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《浙江大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《浙江大学学报(理学版)》下载免费的PDF全文 |
