Topological Properties of Hypercubes
IEEE Transactions on Computers
On the existence of Hamiltonian circuits in faulty hypercubes
SIAM Journal on Discrete Mathematics
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Hamilton-connectivity and cycle-embedding of the Möbius cubes
Information Processing Letters
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
Embedding Graphs onto the Supercube
IEEE Transactions on Computers
IEEE Transactions on Computers
On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
Information Sciences—Informatics and Computer Science: An International Journal
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Fault-tolerant cycle-emebedding of crossed cubes
Information Processing Letters
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Mapping Cycles and Trees on Wrap-Around Butterfly Graphs
SIAM Journal on Computing
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges
IEEE Transactions on Computers
Node-pancyclicity and edge-pancyclicity of hypercube variants
Information Processing Letters
On reliability of the folded hypercubes
Information Sciences: an International Journal
Embedding meshes into crossed cubes
Information Sciences: an International Journal
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Sciences: an International Journal
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes
IEEE Transactions on Computers
| Hi-index | 0.00 |
Möbius cubes are an important class of hypercube variants. This paper addresses how to embed a family of disjoint 2D meshes into a Möbius cube. Two major contributions of this paper are: (1) For n ≥ 1, there exists a 2×2n-1 mesh that can be embedded in the n-dimensional Möbius cube with dilation 1 and expansion 1. (2) For n ≥ 4, there are two disjoint 4×2n-3 meshes that can be embedded in the n-dimensional 0-type Möbius cube with dilation 1. The results are optimal in the sense that the dilations of the embeddings are 1. The result (2) mean that a family of two 2D-mesh-structured parallel algorithms can be operated on a same crossed cube efficiently and in parallel.