| 4类图完美匹配数目的递推求法 |
| |
| 引用本文： | 唐保祥,任韩.4类图完美匹配数目的递推求法[J].数学杂志,2015,35(3):626-634. |
| |
| 作者姓名： | 唐保祥 任韩 |
| |
| 作者单位： | 天水师范学院数学与统计学院, 甘肃 天水 741001,华东师范大学数学系, 上海 200062 |
| |
| 基金项目： | 国家自然科学基金(11171114). |
| |
| 摘 要： | 本文研究了4类特殊图完美匹配数目的显式表达式.利用划分,求和,再递推的方法分别给出了图3-n Z4,2-n(2-C6),2-n(2-K4)和3-n(C4-C6)的完美匹配数目的计算公式.
|
| 关 键 词： | 完美匹配 线性递推式 特征方程 |
| 收稿时间： | 2013/2/19 0:00:00 |
| 修稿时间： | 2013/6/13 0:00:00 |
RECURSIVE METHOD FOR FINDING THE NUMBER OFPERFECT MATCHINGS OF THE FOUR TYPES OF GRAPHS |
| |
| TANG Bao-xiang and REN Han.RECURSIVE METHOD FOR FINDING THE NUMBER OFPERFECT MATCHINGS OF THE FOUR TYPES OF GRAPHS[J].Journal of Mathematics,2015,35(3):626-634. |
| |
| Authors: | TANG Bao-xiang and REN Han |
| |
| Institution: | School of Mathematics and Statistics, Tianshui Normal University, Tianshui 741001, China and Department of Mathematics, East China Normal University, Shanghai 200062, China |
| |
| Abstract: | In this paper, we study the explicit expression of the perfect matching number of four types of graphs. By using difierentiation, summation and re-recursion, the counting formula of the perfect matching for graphs 3-nZ4, 2-n(2-C6), 2-n(2-K4) and 3-n(C4-C6) is made. |
| |
| Keywords: | perfect matching linear recurrence relation characteristic equation |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《数学杂志》浏览原始摘要信息 |
| 点击此处可从《数学杂志》下载免费的PDF全文 |
|
