Hamiltonian cycles in 1-tough graphs (Q2563428)

For a graph \(G\) let \(\sigma_3= \min \{d(u_1) +d(u_2) +d(u_3)\}\) and \(\overline \sigma_3= \min \{d(u_1)+ d(u_2)+ d(u_3)- |N(u_1) \cap N(u_2) \cap N(u_3) |\}\) where \(\{u_1,u_2,u_3\}\) ranges over all 3-element independent sets of \(G\). It is proved that if \(G\) is a 1-tough graph of order \(n\) such that \(\sigma_3\geq n\) and \(\overline\sigma_3\geq n-4\) then \(G\) is hamiltonian. This generalizes results of \textit{B. Fassbender} [Ars Comb. 33, 300-304 (1992; Zbl 0764.05050)], \textit{E. Flandrin} et al. [Discrete Math. 90, No. 1, 41-52 (1991; Zbl 0746.05038)] and \textit{H. A. Jung} [Ann. Discrete Math. 3, 129-144 (1978; Zbl 0399.05039)].