| 图有不含匹配的[a,b]-因子的邻域条件 |
| |
| 引用本文： | 李建湘.图有不含匹配的[a,b]-因子的邻域条件[J].邵阳学院学报(自然科学版),2001,14(3):167-169. |
| |
| 作者姓名： | 李建湘 |
| |
| 作者单位： | 邵阳高等专科学校基础课部, |
| |
| 摘 要： | 设G是一个n阶图,a和b是整数使得1≤a＜b.设H是G的具有m条边的匹配,δ(G)是最小度.证明了若δ(G)≥a+1,n≥2(a+b)(a+b-1)/b,并且对G的任意两个不相邻的点x和y都有|NG(x)U
NG(y)|≥an/(a+b)+2,则G有a,b]-因子F使得E(H)nE(F)=
|
| 关 键 词： | 因 因子 [a b]-因子 匹配 邻城 |
| 文章编号： | 1009-2439(2001)03-0167-03 |
| 修稿时间： | 2001年6月17日 |
The neighborhood
condition for graphs to have [ a, b ] - factors containing no an matching |
| |
| Abstract.The neighborhood
condition for graphs to have [ a, b ] - factors containing no an matching[J].Journal of Shaoyang University:Science and Technology,2001,14(3):167-169. |
| |
| Authors: | Abstract |
| |
| Abstract: | Let G be a graph of order n ,and let a and b be integers such that 1 ≤ a ＜ b . Let H be any matching of G with m edges, and δ(G) be the minimum degree. Then we prove that ifδ(G)≥ a + 1, n ≥ 2( a + b )( a + b - 1 )/b,and | NG ( x ) ∪ No (y) | ≥ an/( a + b ) + 2 for any two non - adjacent vertices x and y of G, then G has an a, b ] -factor F such that E(H)∩E(F) =? |
| |
| Keywords: | |
| 本文献已被 万方数据 等数据库收录！ |
|
