Abstract
We prove that if G is a 1-tough graph withn ≥ 3 vertices such thatd(u) + d(v) +d(w) ≥n+ κ —2 holds for any triple of independent verticesu, v andw ofG, thenG is hamiltonian, wherek is the vertex connectivity ofG. This generalizes a recent result of Baur and Schmeichel.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have