| 3类图1-因子的数目 |
| |
| 引用本文： | 唐保祥,任韩. 3类图1-因子的数目[J]. 河南师范大学学报(自然科学版), 2012, 40(1): 21-23 |
| |
| 作者姓名： | 唐保祥 任韩 |
| |
| 作者单位： | 1. 天水师范学院数学与统计学院,甘肃天水,741001
2. 华东师范大学数学系,上海,200062 |
| |
| 摘 要： | 图的1-因子计数问题是匹配理论研究中的一个重要课题,此问题有很强的物理学和化学背景.但是,一般图的1-因子计数问题却是NP-困难的.用划分,求和,再递推的方法分别给出了图2-2nC5,2-nC6和N2n的1-因子数目的计算公式.
|
| 关 键 词： | 1-因子 线性递推式 特征方程 |
The Number of 1-Factors for Three Types of Graphs |
| |
| TANG Bao-xiang , REN Han. The Number of 1-Factors for Three Types of Graphs[J]. Journal of Henan Normal University(Natural Science), 2012, 40(1): 21-23 |
| |
| Authors: | TANG Bao-xiang REN Han |
| |
| Affiliation: | 1.School of Mathematics and Statistics,Tianshui Normal University,Tianshui 741001,China; 2.Department of Mathematics,East China Normal University,Shanghai 200062,China) |
| |
| Abstract: | The counting problem of 1-factor of graphs is the key task of the theoretical research for matching.It is the special background of physics and chemistry.However,the counting problem of 1-factor for general graphs is NP-which is difficult.The counting formula of the 1-factor for graphs is made by applying differentiation,summation and re-recursion in this research. |
| |
| Keywords: | 1-factor linear recurrence relation characteristic equation |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
