摘要
证明了下列结论,设G是k-连通的n阶无环图,k≥2,若对G中任意k-独立集,X={x_0,x_1,……x_(k-1)},有sum from i=0 to (k-1)|N(X-x_i)|>(k-1)_n,则G为Hamilton-连通图。
In this paper, the following result is proved. Let G .be a k-cormected graph of order n without loops ,k≥2,if sum from i=0 to k-1|N(X-x_i)>(k-1)n for any k-independent set,X={x_0,x_1……x_(k-1)},then G is Hamilton-cormected graph
关键词
K-连通图
k-独立集
图论
Hamilton-cormected graph
κ-cormected graph
κ-independent set
