Vertex-Disjoint Paths in a 3-Ary - Cube with Faulty Vertices

Xiaolei Ma and Shiying Wang

Mathematical Problems in Engineering, 2020, vol. 2020, 1-14

Abstract:

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 - ary - cube is a family of popular networks. In this paper, we determine that there are disjoint paths in 3-ary - cube covering from to (many-to-many) with and from to (one-to-many) with where is in a fault-free cycle of length three.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/3953161.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/3953161.xml (text/xml)

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:hin:jnlmpe:3953161

DOI: 10.1155/2020/3953161

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().