Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
Topological Properties of Hypercubes
IEEE Transactions on Computers
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
On edge-disjoint spanning trees in hypercubes
Information Processing Letters
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges
IEEE Transactions on Computers
A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM* model
Computers & Mathematics with Applications
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
Edge-disjoint Hamiltonian cycles in hypertournaments
Journal of Graph Theory
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Theoretical Computer Science
Constructing edge-disjoint spanning trees in locally twisted cubes
Theoretical Computer Science
Conditional Edge-Fault Hamiltonicity of Matching Composition Networks
IEEE Transactions on Parallel and Distributed Systems
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Edge-fault-tolerant node-pancyclicity of twisted cubes
Information Processing Letters
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
Information Processing Letters
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
SIAM Journal on Discrete Mathematics
Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes
IEEE Transactions on Computers
Hamiltonian properties of honeycomb meshes
Information Sciences: an International Journal
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
Theoretical Computer Science
| Hi-index | 5.23 |
The n-dimensional hypercube network Q"n is one of the most popular interconnection networks since it has simple structure and is easy to implement. The n-dimensional locally twisted cube LTQ"n, an important variation of the hypercube, has the same number of nodes and the same number of connections per node as Q"n. One advantage of LTQ"n is that the diameter is only about half of the diameter of Q"n. Recently, some interesting properties of LTQ"n have been investigated in the literature. The presence of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traffic to be spread evenly across the interconnection network. The existence of two edge-disjoint Hamiltonian cycles in locally twisted cubes has remained unknown. In this paper, we prove that the locally twisted cube LTQ"n with n=4 contains two edge-disjoint Hamiltonian cycles. Based on the proof of existence, we further provide an O(n2^n)-linear time algorithm to construct two edge-disjoint Hamiltonian cycles in an n-dimensional locally twisted cube LTQ"n with n=4, where LTQ"n contains 2^n nodes and n2^n^-^1 edges.