Vertex-Disjoint Paths in a 3-Ary n-Cube with Faulty Vertices
Keyword(s):
The construction of vertex-disjoint paths (disjoint paths) is an important research topic in various kinds of interconnection networks, which can improve the transmission rate and reliability. The k-ary n-cube is a family of popular networks. In this paper, we determine that there are m2≤m≤n disjoint paths in 3-ary n-cube covering Qn3−F from S to T (many-to-many) with F≤2n−2m and from s to T (one-to-many) with F≤2n−m−1 where s is in a fault-free cycle of length three.
2014 ◽
Vol 602-605
◽
pp. 3570-3574
2014 ◽
Vol 46
(1)
◽
pp. 145-161
2019 ◽
Vol 10
(4)
◽
pp. 1-25
2016 ◽
Vol 2016
◽
pp. 1-6
◽