摘要
设 n为偶数 ,r和 k为奇数 ,n>r>k>0 ,λ≥ 2为整数 ,λ*=2 [λ/ 2 ] +1 ,r-λ*k>0 .G是有 n个顶点、边连通度为λ的 r-正则图 .若 n<( r+2 ) ( k+1 ) ,则 G是
Let n>r>k>0 with n even and r and k odd and let λ≥2 be an integer.If G is an r regular graph of even order n and edge connectivity λ.If r-λ *k>0 where λ *=2[λ/2]+1 ,and n<(r+2)(k+1) ,then G is k eliminated.
