Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
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 Ring Embedding in de Bruijn Networks
IEEE Transactions on Computers
Fault Diameter of k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
Fault tolerant token ring embedding in double loop networks
Information Processing Letters
On ring embedding in hypercubes with faulty nodes and links
Information Processing Letters
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Topological properties of twisted cube
Information Sciences—Informatics and Computer Science: An International Journal
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Ring embedding in faulty pancake graphs
Information Processing Letters
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
The t/k-Diagnosability of the BC Graphs
IEEE Transactions on Computers
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
Fault hamiltonicity of augmented cubes
Parallel Computing
Hamiltonicity of the WK-Recursive Network with and without Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed Computing
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
Fault-tolerant pancyclicity of augmented cubes
Information Processing Letters
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
The two-equal-disjoint path cover problem of Matching Composition Network
Information Processing Letters
Embedding a family of meshes into twisted cubes
Information Processing Letters
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Theoretical Computer Science
International Journal of Computer Mathematics
Conditional fault hamiltonian connectivity of the complete graph
Information Processing Letters
Edge-fault-tolerant node-pancyclicity of twisted cubes
Information Processing Letters
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Constructing edge-disjoint spanning trees in twisted cubes
Information Sciences: an International Journal
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance
The Journal of Supercomputing
One-to-one communication in twisted cubes under restricted connectivity
Frontiers of Computer Science in China
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences: an International Journal
Theoretical Computer Science
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Information Sciences: an International Journal
Note: Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
Theoretical Computer Science
On the surface area of the asymmetric twisted cube
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Independent spanning trees on twisted cubes
Journal of Parallel and Distributed Computing
Research on petersen graphs and hyper-cubes connected interconnection networks
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Edge-pancyclicity of twisted cubes
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Fault-Tolerant cycle embedding in the WK-Recursive network
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Many-to-Many disjoint path covers in a graph with faulty elements
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Geodesic pancyclicity of twisted cubes
Information Sciences: an International Journal
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
Theoretical Computer Science
Hi-index | 0.01 |
The twisted cube TQn, is derived by changing some connection of hypercube Qn according to specific rules. Recently, many topological properties of this variation cube are studied. In this paper, we consider a faulty twisted n-cube with both edge and/or node faults. Let F be a subset of V(TQn) ∩ E(TQn), we prove that TQn - F remains hamiltonian if |F| ≤ n - 2. Moreover, we prove that there exists a hamiltonian path in TQn - F joining any two vertices u, v in V(TQn)-F if |F| ≤ n - 3. The result is optimum in the sense that the fault-tolerant hamiltonicity (fault-tolerant hamiltonian connectivity respectively) of TQn is at most n - 2 (n - 3 respectively).