|
| 摘要: |
| 本文研究了4类特殊图完美匹配数目的显式表达式.利用划分,求和,再递推的方法分别给出了图3-nZ4,2-n(2-C6),2-n(2-K4)和3-n(C4-C6)的完美匹配数目的计算公式. |
| 关键词: 完美匹配 线性递推式 特征方程 |
| DOI： |
| 分类号:O157.5 |
| 基金项目:国家自然科学基金(11171114). |
|
| RECURSIVE METHOD FOR FINDING THE NUMBER OFPERFECT MATCHINGS OF THE FOUR TYPES OF GRAPHS |
|
TANG Bao-xiang,REN Han
|
| 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. |
| Key words: perfect matching linear recurrence relation characteristic equation |
