Abstract
Let G be a 2-connected claw-free graph of order n. If for each pair of vertices u and v dist(u,v)=3⇒ max(d(u),d(v))⩾(n−4)/2, then G is Hamiltonian.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
