| 2类图完美匹配计数公式的嵌套递推求法 |
| |
| 引用本文： | 唐保祥,任韩.2类图完美匹配计数公式的嵌套递推求法[J].西南师范大学学报(自然科学版),2019,44(8):23-27. |
| |
| 作者姓名： | 唐保祥 任韩 |
| |
| 作者单位： | 天水师范学院数学与统计学院;华东师范大学数学系 |
| |
| 基金项目： | 国家自然科学基金项目（11171114）. |
| |
| 摘 要： | 把图2-nD_8和2-nD_6的完美匹配按饱和某个顶点的完美匹配进行分类,求出每一类完美匹配数目的递推关系式,再利用这些递推式之间的相互关系,得到这两类图的完美匹配数目的递推关系式,最后从递推式中解出这两类图的完美匹配数目的计算公式.
|
| 关 键 词： | 完美匹配 线性递推式 特征方程 通解 |
| 收稿时间： | 2018/9/10 0:00:00 |
Two Types of Nested Recursive Methods for Finding Counting Formulas of Perfect Matching Number |
| |
| TANG Bao-xiang,REN Han.Two Types of Nested Recursive Methods for Finding Counting Formulas of Perfect Matching Number[J].Journal of Southwest China Normal University(Natural Science),2019,44(8):23-27. |
| |
| Authors: | TANG Bao-xiang REN Han |
| |
| Institution: | 1. School of Mathematics and Statistics, Tianshui Normal University, Tianshui Gansu 741001, China;2. Department of Mathematics, East China Normal University, Shanghai 200062, China |
| |
| Abstract: | The perfect matching of graphs 2-nD8 and 2-nD6 has been classified according to the perfect matching of a certain vertex of saturation, and the recursive relation of each kind of perfect matching number been obtained. Then the interrelationship between these recursive formulas has been used to eliminate those that are not needed. The recursive relation has been used to obtain the recursive relation of the perfect matching number of the two kinds of graphs. Finally, the formula for calculating the perfect matching number of the two graphs has been solved from the recursive formula. |
| |
| Keywords: | perfect matching linear recurrence relation characteristic equation general solution |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《西南师范大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《西南师范大学学报(自然科学版)》下载免费的PDF全文 |
