Fault-Tolerant Routing in DeBruijn Comrnunication Networks
IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
On the existence of Hamiltonian circuits in faulty hypercubes
SIAM Journal on Discrete Mathematics
The twisted cube topology for multiprocessors: a study in network asymmetry
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fault-tolerant multicasting on hypercubes
Journal of Parallel and Distributed Computing
Efficient gossiping by packets in networks with random faults
SIAM Journal on Discrete Mathematics
Parallel computation: models and methods
Parallel computation: models and methods
Fault Diameter of k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
Topological properties of twisted cube
Information Sciences—Informatics and Computer Science: An International Journal
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
SIAM Journal on Discrete Mathematics
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions
IEEE Transactions on Computers
Safety Levels-An Efficient Mechanism for Achieving Reliable Broadcasting in Hypercubes
IEEE Transactions on Computers
Fault-tolerant cycle embedding in the hypercube
Parallel Computing
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Conditional fault Hamiltonicity of the complete graph
Information Processing Letters
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Information Sciences: an International Journal
Fault-Free Cycles in Conditional Faulty Folded Hypercubes
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Fault-Tolerant Hamiltonicity of Augmented Cubes under the Conditional Fault Model
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Edge-fault-tolerant node-pancyclicity of twisted cubes
Information Processing Letters
Two-node-Hamiltonicity of enhanced pyramid networks
Information Sciences: an International Journal
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
Constructing edge-disjoint spanning trees in twisted cubes
Information Sciences: an International Journal
Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
Information Sciences: an International Journal
Pancyclicity of ternary n-cube networks under the conditional fault model
Information Processing Letters
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
SIAM Journal on Discrete Mathematics
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences: an International Journal
Hamiltonian properties of twisted hypercube-like networks with more faulty elements
Theoretical Computer Science
Theoretical Computer Science
ω-wide diameters of enhanced pyramid networks
Theoretical Computer Science
Note: Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
Theoretical Computer Science
Fault tolerance in bubble-sort graph networks
Theoretical Computer Science
Fault tolerance in k-ary n-cube networks
Theoretical Computer Science
Conditional edge-fault pancyclicity of augmented cubes
Theoretical Computer Science
Nonflat surface level pyramid: a high connectivity multidimensional interconnection network
The Journal of Supercomputing
| Hi-index | 5.26 |
The n-dimensional twisted cube, denoted by TQ"n, a variation of the hypercube, possesses some properties superior to the hypercube. In this paper, assuming that each vertex is incident with at least two fault-free links, we show that TQ"n can tolerate up to 2n-5 edge faults, while retaining a fault-free Hamiltonian cycle. The result is optimal with respect to the number of edge faults tolerated.