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

Reliability analysis based on the dual-CIST in shuffle-cubes

Author

Listed:
  • Qin, Xiao-Wen
  • Hao, Rong-Xia

Abstract

Let T1,T2,…,Tk be k spanning trees of the graph G. They are called completely independent spanning trees (CISTs for short) if the paths joining every pair of vertices x and y in any two trees have neither vertex nor edge in common, except for x and y. In particular, two CISTs are called a dual-CIST. The construction of a dual-CIST in a network has applications in the fault-tolerance of data transmission and the establishment of a protection routing. It has been proved that determining if a graph G admits a dual-CIST is NP-complete. In this paper, we show the existence of a dual-CIST in the n-dimensional shuffle-cube SQn with n=4k+2 and k≥1. Furthermore, recursive construction algorithms for the dual-CIST in SQn are given.

Suggested Citation

  • Qin, Xiao-Wen & Hao, Rong-Xia, 2021. "Reliability analysis based on the dual-CIST in shuffle-cubes," Applied Mathematics and Computation, Elsevier, vol. 397(C).
    • Handle: RePEc:eee:apmaco:v:397:y:2021:i:c:s0096300320308535
    DOI: 10.1016/j.amc.2020.125900
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320308535
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125900?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. Qin, Xiao-Wen & Chang, Jou-Ming & Hao, Rong-Xia, 2019. "Constructing dual-CISTs of DCell data center networks," Applied Mathematics and Computation, Elsevier, vol. 362(C), pages 1-1.
    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. Yu-Han Chen & Kung-Jui Pai & Hsin-Jung Lin & Jou-Ming Chang, 2022. "Constructing tri-CISTs in shuffle-cubes," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3194-3211, December.

    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. Yang, Jinn-Shyong & Li, Xiao-Yan & Peng, Sheng-Lung & Chang, Jou-Ming, 2022. "Parallel construction of multiple independent spanning trees on highly scalable datacenter networks," Applied Mathematics and Computation, Elsevier, vol. 413(C).
    2. Yu-Han Chen & Kung-Jui Pai & Hsin-Jung Lin & Jou-Ming Chang, 2022. "Constructing tri-CISTs in shuffle-cubes," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3194-3211, December.
    3. Hao, Rong-Xia & Qin, Xiao-Wen & Zhang, Hui & Chang, Jou-Ming, 2024. "Two-disjoint-cycle-cover pancyclicity of data center networks," Applied Mathematics and Computation, Elsevier, vol. 475(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:397:y:2021:i:c:s0096300320308535. 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.