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

Edge disjoint paths in hypercubes and folded hypercubes with conditional faults

Author

Listed:
  • Qiao, Yalin
  • Yang, Weihua

Abstract

It is known that edge disjoint paths is closely related to the edge connectivity and the multicommodity flow problems. In this paper, we study the edge disjoint paths in hypercubes and folded hypercubes with edge faults. We first introduce the F-strongly Menger edge connectivity of a graph, and we show that in all n-dimensional hypercubes (folded hypercubes, respectively) with at most 2n−4(2n−2, respectively) edges removed, if each vertex has at least two fault-free adjacent vertices, then every pair of vertices u and v are connected by min{deg(u), deg(v)} edge disjoint paths, where deg(u) and deg(v) are the remaining degree of vertices u and v, respectively.

Suggested Citation

  • Qiao, Yalin & Yang, Weihua, 2017. "Edge disjoint paths in hypercubes and folded hypercubes with conditional faults," Applied Mathematics and Computation, Elsevier, vol. 294(C), pages 96-101.
  • Handle: RePEc:eee:apmaco:v:294:y:2017:i:c:p:96-101
    DOI: 10.1016/j.amc.2016.09.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316305628
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2016.09.002?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. Yang, Yayu & Zhang, Mingzu & Meng, Jixiang, 2024. "Link fault tolerance of BC networks and folded hypercubes on h-extra r-component edge-connectivity," Applied Mathematics and Computation, Elsevier, vol. 462(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:294:y:2017:i:c:p:96-101. 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.