【摘要】 G为图 ,G 是G的部分平方图 .运用 (k + 2 )连通图 (k≥ 2 )上的插点技术 ,借助LTW序列对G 中独立集的邻域交加权 ,证明了图G是几乎Hamilton连通的一些充分条件更多还原

【Abstract】 Let G be a graph,and G  the partially square graph of G .In this paper,by using the technique of the vertex insertion on ( k+2 ) connected (k≥2) graphs,we give some sufficient conditions for graphs,which are to be 1 almost hamiltonian or almost hamiltonian connected expressed by weighted sums of the neighborhood intersections in G of independent sets in G  ,where the weights are LTW sequences.更多还原