From Hall's matching theorem to optimal routing on hypercubes
Journal of Combinatorial Theory Series B
Recursive circulants and their embeddings among hypercubes
Theoretical Computer Science
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing
Nearly Optimal One-to-Many Parallel Routing in Star Networks
IEEE Transactions on Parallel and Distributed Systems
The super-connected property of recursive circulant graphs
Information Processing Letters
Graph Theory With Applications
Graph Theory With Applications
A topological property of hypercubes: node disjoint paths
SPDP '90 Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
The two-equal-disjoint path cover problem of Matching Composition Network
Information Processing Letters
A novel path protection scheme for MPLS networks using multi-path routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In a graph G, k vertex disjoint paths joining k distinct source-sink pairs that cover all the vertices in the graph are called a many-to-many k-disjoint path cover(k-DPC) of G We consider an f-fault k-DPC problem that is concerned with finding many-to-many k-DPC in the presence of f or less faulty vertices and/or edges We consider the graph obtained by merging two graphs H0 and H1, |V(H0)| = |V(H1)| = n, with n pairwise nonadjacent edges joining vertices in H0 and vertices in H1 We present sufficient conditions for such a graph to have an f-fault k-DPC and give the construction schemes Applying our main result to interconnection graphs, we observe that when there are f or less faulty elements, all of recursive circulant G(2m,4), twisted cube TQm, and crossed cube CQm of degree m have f-fault k-DPC for any k ≥ 1 and f ≥ 0 such that f + 2k ≤ m–1.