IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v325y2018icp332-339.html
   My bibliography  Save this article

Some sufficient conditions on k-connected graphs

Author

Listed:
  • Zhou, Qiannan
  • Wang, Ligong
  • Lu, Yong

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.

Suggested Citation

  • Zhou, Qiannan & Wang, Ligong & Lu, Yong, 2018. "Some sufficient conditions on k-connected graphs," Applied Mathematics and Computation, Elsevier, vol. 325(C), pages 332-339.
    • Handle: RePEc:eee:apmaco:v:325:y:2018:i:c:p:332-339
    DOI: 10.1016/j.amc.2017.12.043
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630031830002X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.12.043?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu, Qinghai & Hong, Yanmei, 2019. "The reliability of lexicographic product digraphs," Applied Mathematics and Computation, Elsevier, vol. 358(C), pages 449-454.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:325:y:2018:i:c:p:332-339. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.