s-Hamilton-连通图的一个充分条件

A Sufficient Condition for s-Hamilton-Connected Graphs

证明了下面的结论 :设G是n阶 (k+2 +s) 连通图 ,G 为G的部分平方图 ,k≥ 2 ,而 (a1,a2 ,… ,ak+ 1)是k LTW序列 .若对于每个X ∈Ik+ 1(G ) ,在G中有 k+ 1i=1aisi(X) >n +s,则G是s Hamilton

Let G be a (k+s+2) connected graph of order n with k≥2 ,and ( a 1,a 2,...,a k+1 ) be a k LTW sequence.If k+1i=1a is i(Z)>n+s for each Z∈I k+1 (G ) ,then G is s Hamilton Connected,where G  denotes the partially square graph of G .