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
Parallel computation: models and methods
Parallel computation: models and methods
Cycles in the cube-connected cycles graph
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Graph Theory With Applications
Graph Theory With Applications
Efficient Techniques for Clustering and Scheduling onto Embedded Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Geodesic pancyclicity and balanced pancyclicity of Augmented cubes
Information Processing Letters
Node-pancyclicity and edge-pancyclicity of hypercube variants
Information Processing Letters
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
Discrete Applied Mathematics
The m-pancycle-connectivity of a WK-Recursive network
Information Sciences: an International Journal
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Path embeddings in faulty 3-ary n-cubes
Information Sciences: an International Journal
Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links
Information Sciences: an International Journal
Topological properties of twisted cube
Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Edge-pancyclicity of twisted cubes
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
Theoretical Computer Science
Hamiltonian properties of honeycomb meshes
Information Sciences: an International Journal
| Hi-index | 0.07 |
The hypercube is one of the most popular interconnection networks since it has simple structure and is easy to implement. An n-dimensional twisted cube, TQ"n, is an important variation of the hypercube Q"n and preserves many of its desirable properties. The problem of embedding linear arrays and cycles into a host graph has attracted substantial attention in recent years. The geodesic cycle embedding problem is for any two distinct vertices, to find all the possible lengths of cycles that include a shortest path joining them. In this paper, we prove that TQ"n is geodesic 2-pancyclic for each odd integer n=3. This result implies that TQ"n is edge-pancyclic for each odd integer n=3. Moreover, TQ"nxK"2 is also demonstrated to be geodesic 4-pancyclic.