| 图中含有k－因子的一个充分性条件 |
| |
| 引用本文： | 俞政.图中含有k－因子的一个充分性条件[J].五邑大学学报(自然科学版),1995(1). |
| |
| 作者姓名： | 俞政 |
| |
| 作者单位： | 五邑大学数理系 |
| |
| 摘 要： | 设ｋ是一不小于３的整数，Ｇ是连通图，具顶点数ｎ≥７ｋ－７，ｋｎ是偶数，且Ｇ的最小度δ（Ｇ）≥ｋ。本文证明了：若对Ｇ中任意一对不相邻的顶点ｕ、ｖ均有２ｎ－１≤ｄ（ｕ）＋ｄ（ｖ）十２｜（ｕ）ＵＮ（Ｖ）Ｄ，则Ｇ有ｋ一因子。
|
| 关 键 词： | 度和 邻域并 |
A Sufficient Condition Which Implies the Existence of k-factors in Graph |
| |
| Yu Zheng.A Sufficient Condition Which Implies the Existence of k-factors in Graph[J].Journal of Wuyi University(Natural Science Edition),1995(1). |
| |
| Authors: | Yu Zheng |
| |
| Abstract: | Let k be an integer such that k 3,and let G be a connected graph of order n with n at least 7k-7,kn even,and minimum degree at least k. This article gives a sufficient condition of which G has a k-factor involving the degree sum and the neighborhood union of any two independent venrtices. |
| |
| Keywords: | Degree Sum Neighborhood Union |
| 本文献已被 CNKI 等数据库收录！ |
