Abstract
We give a new shorter proof of the following theorem: Let G be a 2-connected graph of order n. If max {d (u); d (v)} ≥ c/2 for any two vertices u and v with d (u; v) = 2, then the circumference of G is at least c, where 3 ≤ c ≤ n and d (u; v) is the distance between vertices u and v in G. We also propose some problems.
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 callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: 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.
