| 图2-2nP5和2-nK1,1,1,3完美匹配的计数 |
| |
| 引用本文： | 唐保祥,任韩.图2-2nP5和2-nK1,1,1,3完美匹配的计数[J].吉林大学学报(理学版),2020,58(4):859-863. |
| |
| 作者姓名： | 唐保祥 任韩 |
| |
| 作者单位： | 1. 天水师范学院 数学与统计学院, 甘肃 天水 741001； 2. 华东师范大学 数学系, 上海 200062 |
| |
| 摘 要： | 把图2-2nP5和2-nK1,1,1,3的完美匹配按匹配一个固定顶点的边进行分类, 先求出每类完美匹配数目的递推关系式, 得到一组有相互联系的递推关系式, 再利用这组递推式之间的相互关系, 给出这两个图完美匹配数的计数公式.
|
| 关 键 词： | 完美匹配 分类 递推式关系 计数公式 |
| 收稿时间： | 2019-12-09 |
Perfect Matching Counts for 2-2nP5 and 2-nK1,1,1,3Graphs |
| |
| TANG Baoxiang,REN Han.Perfect Matching Counts for 2-2nP5 and 2-nK1,1,1,3Graphs[J].Journal of Jilin University: Sci Ed,2020,58(4):859-863. |
| |
| Authors: | TANG Baoxiang REN Han |
| |
| Institution: | 1. School of Mathematics and Statistics, Tianshui Normal University, Tianshui 741001, Gansu Province, China；
2. Department of Mathematics, East China Normal University, Shanghai 200062, China
|
| |
| Abstract: | The perfect matchings of 2-2nP5 and 2-nK1,1,1,3 graphs were classified according to the edges that matched a fixed vertex. First, we found out the recurrence relations of each kind of perfect matching number, and obtained a set of recurrence relations
which were related to each other. Then we used the correlation between these recurrence relations to give the counting formula of the perfect matching mumber of these two graphs. |
| |
| Keywords: | perfect matching classification recurrence relation counting formula |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文 |
|
