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

Xiao-Wen Qin and Rong-Xia Hao

Applied Mathematics and Computation, 2021, vol. 397, issue C

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.

Keywords: Completely independent spanning tree; Shuffle-cube, CIST-partition; recursive algorithm (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320308535
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:397:y:2021:i:c:s0096300320308535

DOI: 10.1016/j.amc.2020.125900

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().