TY - JOUR
T1 - Some sufficient conditions on k-connected graphs
AU - Zhou, Qiannan
AU - Wang, Ligong
AU - Lu, Yong
N1 - Publisher Copyright:
© 2018 Elsevier Inc.
PY - 2018/5/15
Y1 - 2018/5/15
N2 - 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.
AB - 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.
KW - Distance signless Laplacian spectral radius
KW - Distance spectral radius
KW - K-connected
KW - Signless Laplacian spectral radius
UR - http://www.scopus.com/inward/record.url?scp=85041393473&partnerID=8YFLogxK
U2 - 10.1016/j.amc.2017.12.043
DO - 10.1016/j.amc.2017.12.043
M3 - 文章
AN - SCOPUS:85041393473
SN - 0096-3003
VL - 325
SP - 332
EP - 339
JO - Applied Mathematics and Computation
JF - Applied Mathematics and Computation
ER -