k—连通图为D_λ—连通的一个充分条件

A Sufficient Condition for k-connected Graphs to be D_λ-connected

本文在对有限简单图给出 D_λ—连通的定义之后,证明了下述定理:设 G 是n 阶 k—连通(k≥3)的有限简单图,如果对任意的 Y∈I_k(G,λ),有sum from i=1 to k (k+i-2)/(k-1)s_i(Y、λ)>n-k(λ-1),则 G 是 D_λ—连通的.

In this paper,the definition of the D_λ-connected graphs is given,and thefollowing theorem is proved:let G be a k-connected(k≤3)graph of order n,if for any Y∈I_h(G,λ)sum from i-1 to k (k+i-2)/(k-1) s_i(Y,λ)>n-k(λ-1),then G is D_λ-connected.