| 最小度确定时最大匹配个数的估计 |
| |
| 引用本文： | 李小华,王迪吉.最小度确定时最大匹配个数的估计[J].新疆师范大学学报(自然科学版),2007,26(3):88-89. |
| |
| 作者姓名： | 李小华 王迪吉 |
| |
| 作者单位： | 新疆师范大学,数理信息学院,新疆,乌鲁木齐,830054 |
| |
| 摘 要： | 文章讨论了K_(n,n)的生成子图有完美匹配的条件,以及对K_(n,n)的生成子图的最小度确定时,得到了它的最大匹配数的一个下界.
|
| 关 键 词： | 二部图 生成子图 匹配 覆盖 |
| 文章编号： | 1008-9659-（2007）-03-0088-02 |
| 修稿时间： | 2007-04-17 |
A Evaluation of the number of maximum matching when the minimum degree are fixed |
| |
| Li Xiaohua.A Evaluation of the number of maximum matching when the minimum degree are fixed[J].Journal of Xinjiang Normal University(Natural Sciences Edition),2007,26(3):88-89. |
| |
| Authors: | Li Xiaohua |
| |
| Institution: | School of Maths - physics and Information Science,Xinjiang Normal University ,Urumqi Xinjiang 830054 |
| |
| Abstract: | In this paper,we discuss the condition that the spanning subgraph of has perfect matching, and when the minimum degree of the spanning subgraph of are fixed, we obtain the lower bound of the number of maximum matching. |
| |
| Keywords: | Bipartite graph Spanning subgraph Matching Covering |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
