IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i5d10.1007_s10878-022-00863-0.html
   My bibliography  Save this article

Constructing tri-CISTs in shuffle-cubes

Author

Listed:
  • Yu-Han Chen

    (National Taipei University of Business)

  • Kung-Jui Pai

    (Ming Chi University of Technology)

  • Hsin-Jung Lin

    (National Taipei University of Business)

  • Jou-Ming Chang

    (National Taipei University of Business)

Abstract

Let $${\mathcal {T}}=\{T_1,T_2,\ldots ,T_k\}$$ T = { T 1 , T 2 , … , T k } be a set of $$k\geqslant 2$$ k ⩾ 2 spanning trees in a graph G. The k spanning trees 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. Particularly, $${\mathcal {T}}$$ T is called a dual-CIST (resp. tri-CIST) provided $$k=2$$ k = 2 (resp. $$k=3$$ k = 3 ). From an algorithmic point of view, the problem of finding a dual-CIST in a given graph is known to be NP-hard. For data transmission applications in reliable networks, the existence of a dual-CIST can provide a configuration of fault-tolerant routing called protection routing. The presence of a tri-CIST can enhance the dependability of transmission and carry out secure message distribution for confidentiality. Recently, the construction of a dual-CIST has been proposed in a shuffle-cube $$SQ_n$$ S Q n , which is an innovative hypercube-variant network that possesses both short diameter and connectivity advantages. This paper uses the CIST-partition technique to construct a tri-CIST of $$SQ_6$$ S Q 6 , and shows that the diameters of three CISTs are 22, 22, and 13. Then, by the hierarchical structure of $$SQ_n$$ S Q n , we propose a recursive algorithm for constructing a tri-CIST for high-dimensional shuffle-cubes. When $$n\geqslant 10$$ n ⩾ 10 , the diameters of $$T_i$$ T i , $$i=1,2,3$$ i = 1 , 2 , 3 , we constructed for $$SQ_n$$ S Q n are as follows: $$2n+11$$ 2 n + 11 , $$2n+9$$ 2 n + 9 , and $$2n+1$$ 2 n + 1 .

Suggested Citation

  • 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.
  • Handle: RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00863-0
    DOI: 10.1007/s10878-022-00863-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-022-00863-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-022-00863-0?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.
    2. 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).
    Full references (including those not matched with items on IDEAS)

    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. 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).
    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:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00863-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.