Some sufficient conditions on k-connected graphs

Qiannan Zhou, Ligong Wang and Yong Lu

Applied Mathematics and Computation, 2018, vol. 325, issue C, 332-339

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.

Keywords: K-connected; Signless Laplacian spectral radius; Distance spectral radius; Distance signless Laplacian spectral radius (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031830002X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:325:y:2018:i:c:p:332-339

DOI: 10.1016/j.amc.2017.12.043

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().