k-消去图的一个充分条件  

A SUFFICIENT CONDITION OF K-DELETED GRAPHS

作　　者：颜谨[1] 

机构地区：[1]山东工业大学数理系,济南250061

出　　处：《山东工业大学学报》1999年第6期578-581,共4页

摘　　要：论证了 :对整数 n(n≥ 3 )和 k(k≥ 2 ) ,若 k为奇数则令 k≥n-1 ,G是一个不含k1,n的 2 -边连通图 ,k| V(G) |≡ 0 (mod2 ) ,设 G的顶点最小度 α(G)至少为 (n2 / 4 (n-1 ) ) k+(3 n-6) / 2 + (n-1 ) / 4 k,则 G是 k-消去图 .并且说明了定理中条件“2 -边连通”不能减弱为“连通”Proves the following theorem. Let n(n≥3) and k(k≥2) be positive integers. If k is an odd, assumes that k≥n-1 . Let G be a 2 edge connected k 1,n free graph with k|V(G)| even, and suppose that the minimum degree of G is at least (n 2/4(n-1))k+(3n-6)/2+(n-1)/4k ,then G is a k deleted graph. Also shows that the condition '2 edge connected' in this theorem cannot be dropped.

关 键 词：因子 消去法 K-消去图 充分条件 

分 类 号：O157.5[理学—数学]