| 两类图完美匹配的计数公式 |
| |
| 引用本文： | 唐保祥,任韩.两类图完美匹配的计数公式[J].吉林大学学报(理学版),2016,54(4):790-792. |
| |
| 作者姓名： | 唐保祥 任韩 |
| |
| 作者单位： | 1. 天水师范学院 数学与统计学院, 甘肃 天水 741001; 2. 华东师范大学 数学系, 上海 200062 |
| |
| 摘 要： | 利用划分、求和、再递推的方法给出图2-nRO_8和图2-F_(2n+1,4)完美匹配数目的计算公式.进一步,用所给的方法可计算出许多图类的所有完美匹配的数目.
|
| 关 键 词： | 完美匹配 线性递推式 特征方程 通解 |
| 收稿时间： | 2015-10-08 |
Counting Formulas of Perfect Matchings of Two Types of Graphs |
| |
| TANG Baoxiang,REN Han.Counting Formulas of Perfect Matchings of Two Types of Graphs[J].Journal of Jilin University: Sci Ed,2016,54(4):790-792. |
| |
| 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: | Using the method of partition, summation and re recursion, we gave the counting formula of the perfect matching number for graphs 2-nRO8 and 2-F2n+1,4. Further, we used the method to calculate the number of all the perfect matching of many graph classes. |
| |
| Keywords: | perfect matching linear recursive formula characteristic equation general solution |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文 |
|
