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

The p-restricted edge-connectivity of Kneser graphs

Author

Listed:
  • Balbuena, C.
  • Marcote, X.

Abstract

Given a connected graph G and an integer 1 ≤ p ≤ ⌊|V(G)|/2⌋, a p-restricted edge-cut of G is any set of edges S ⊂ E(G), if any, such that G−S is not connected and each component of G−S has at least p vertices; and the p-restricted edge-connectivity of G, denoted λp(G), is the minimum cardinality of such a p-restricted edge-cut. When p-restricted edge-cuts exist, G is said to be super-λp if the deletion from G of any p-restricted edge-cut S of cardinality λp(G) yields a graph G−S that has at least one component with exactly p vertices. In this work, we prove that Kneser graphs K(n, k) are λp-connected for a wide range of values of p. Moreover, we obtain the values of λp(G) for all possible p and all n ≥ 5 when G=K(n,2). Also, we discuss in which cases λp(G) attains its maximum possible value, and determine for which values of p graph G=K(n,2) is super-λp.

Suggested Citation

  • Balbuena, C. & Marcote, X., 2019. "The p-restricted edge-connectivity of Kneser graphs," Applied Mathematics and Computation, Elsevier, vol. 343(C), pages 258-267.
    • Handle: RePEc:eee:apmaco:v:343:y:2019:i:c:p:258-267
    DOI: 10.1016/j.amc.2018.09.072
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318308592
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.09.072?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.

    References listed on IDEAS

    as
    1. Wang, Shiying & Ma, Xiaolei, 2018. "The g-extra connectivity and diagnosability of crossed cubes," Applied Mathematics and Computation, Elsevier, vol. 336(C), pages 60-66.
    2. Yang, Da-Wei & Feng, Yan-Quan & Lee, Jaeun & Zhou, Jin-Xin, 2018. "On extra connectivity and extra edge-connectivity of balanced hypercubes," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 464-473.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Chen, Meirun & Habib, Michel & Lin, Cheng-Kuan, 2024. "A novel edge connectivity based on edge partition for hypercube and folded hypercube," Applied Mathematics and Computation, Elsevier, vol. 470(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Guozhen & Wang, Dajin, 2019. "Structure connectivity and substructure connectivity of bubble-sort star graph networks," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    2. Lin, Shangwei & Zhang, Wenli, 2020. "The 1-good-neighbor diagnosability of unidirectional hypercubes under the PMC model," Applied Mathematics and Computation, Elsevier, vol. 375(C).
    3. Liu, Qinghai & Hong, Yanmei, 2019. "The reliability of lexicographic product digraphs," Applied Mathematics and Computation, Elsevier, vol. 358(C), pages 449-454.
    4. Wei, Chao & Hao, Rong-Xia & Chang, Jou-Ming, 2020. "Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes," Applied Mathematics and Computation, Elsevier, vol. 381(C).

    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:343:y:2019:i:c:p:258-267. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.