摘要
We prove that if G is a graph of order n and connectivity k,and thereexists some t,t（?）k,such that for every independent set S={x<sub>0</sub>,x<sub>1</sub>,…x<sub>t</sub>} ofcardinality t+1,we havesum from i=0 to t |N(S/{x<sub>i</sub>}|】t（n-1）,then G is Hamiltonian.
We prove that if G is a graph of order n and connectivity k,and thereexists some t,t(?)k,such that for every independent set S={x_0,x_1,…x_t} ofcardinality t+1,we havesum from i=0 to t |N(S/{x_i}|>t(n-1),then G is Hamiltonian.
基金
Project supported by National Natural Science Foundation of China
