Abstract

In this paper, we consider the least integer d such that every k -connected graph G of order n (and of independent number α ) has a longest cycle containing all vertices of degree at least d . We completely determine the d when k = 2 . We propose a conjecture for those k -connected graph, where k ≥ 3 .

Full Text
Paper version not known

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 call

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.