图有含 (或不含 )特殊边的[a,b]-因子的邻域条件(英文)  

NEIGHBORHOOD CONDITIONS FOR GRAPHS TO HAVE-FACTORS CONTAINING(OR EXCLUDING) SPECIFIED EDGES

作　　者：李建湘[1] 

机构地区：[1]湘潭工学院数理系,湘潭412201

出　　处：《经济数学》2002年第3期19-23,共5页Journal of Quantitative Economics

摘　　要：设 G是一个 n阶图。设 1≤a<b是整数。设 H1 和 H2 是 G的任意两个边不交子图 ,它们分别具有 m1和 m5条边 ,以及 δ(G)表示最小度。证明了 :若 δ(G)≥a+m2 ,n≥ 2 (a+b- m2 ) (a+b- m1 - 1 ) /(b- m1 ) ,a≤ b- (m1 +m2 ) ,并且 |NG(x)∪ NG(y) |≥ an/(a+b- m1 ) +2 m2 对任意两个不相邻的顶点 x和 y成立 ,那么 G有[a,b] -因子 F使得 F含有 H1 的边并不含 H3 的边。Let G be a graph of order n, and let a and b be integers such that 1≤a<b . Let H 1 and H 2 be any two edge disjoint subgraphs of G with m 1 edges and m 2 edges, respectively, and δ(G) be the minimum degree. Then we prove that if δ(G)≥a+m 2,n≥2(a+b-m 1)(a+b-m 1-1)/(b-m 1),a≤b-(m 1+m 2) and |N G(x)∪N G(y)|≥an/(a+b-m 1)+2m 2 for any two non adjacent vertices x and y of G , then G has an factor F such that F containing the edges of H 1 and excluding the edges of H 2 .

关 键 词：图 因子 [a b]-因子 邻域 

分 类 号：F22[经济管理—国民经济]