Abstract
A connected graph G is said to be k-connected if it has more than k vertices and remains connected whenever fewer than k vertices are removed. Feng et al. (2017) presented sufficient conditions based on spectral radius for a graph to be k-connected, k-edge-connected, k-Hamiltonian, k-edge-Hamiltonian, β-deficient and k-path-coverable. In this paper, we present some further sufficient conditions for a graph to be k-connected in terms of signless Laplacian spectral radius, distance spectral radius, distance signless Laplacian spectral radius of G and Wiener index, Harary index of its complement.
Sign-in/Register to access full text options 
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.
