Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fault-Tolerant Ring Embedding in de Bruijn Networks
IEEE Transactions on Computers
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Embedding Hamiltonian cycles into folded hypercubes with faulty links
Journal of Parallel and Distributed Computing
Longest fault-free paths in star graphs with vertex faults
Theoretical Computer Science
Fault-tolerant hamiltonian laceability of hypercubes
Information Processing Letters
Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes
IEEE Transactions on Computers
Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
Embedding longest fault-free paths onto star graphs with more vertex faults
Theoretical Computer Science
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
| Hi-index | 0.00 |
A Hamiltonian path in G is a path which contains every vertex of G exactly once. Two Hamiltonian paths P1=〈u1,u2,...,un〉 and P2=〈v1,v2,...,vn〉 of G are said to be independent if u1=v1, un=vn, and ui≠vi for all 1in. A set of Hamiltonian paths {P1,P2,...,Pk} of G are mutually independent if any two different Hamiltonian paths in the set are independent. It is well-known that an n-dimensional hypercube Qn is bipartite with two partite sets of equal-size. Let F be the set of faulty edges of Qn such that |F|≤n–2. In this paper, we show that Qn–F contains (n–|F|–1)-mutually independent Hamiltonian paths between any two vertices from different partite sets, where n≥2.