A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
Topological properties of the crossed cube architecture
Parallel Computing
Connectivity of the crossed cube
Information Processing Letters
Diagnosability of the Möbius Cubes
IEEE Transactions on Parallel and Distributed Systems
Edge Congestion and Topological Properties of Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions
IEEE Transactions on Computers
Embedding Graphs onto the Supercube
IEEE Transactions on Computers
Embedding Binary Trees into Crossed Cubes
IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
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
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Topological properties of twisted cube
Information Sciences: an International Journal
Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes
IEEE Transactions on Computers
A (4n-9)/3 diagnosis algorithm on n-dimensional cube network
Information Sciences: an International Journal
Hamiltonian laceability of bubble-sort graphs with edge faults
Information Sciences: an International Journal
Embedding meshes into crossed cubes
Information Sciences: an International Journal
The m-pancycle-connectivity of a WK-Recursive network
Information Sciences: an International Journal
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Constructing vertex-disjoint paths in (n, k)-star graphs
Information Sciences: an International Journal
Embedding a family of disjoint 3D meshes into a crossed cube
Information Sciences: an International Journal
The pancyclicity and the Hamiltonian-connectivity of the generalized base-b hypercube
Computers and Electrical Engineering
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
Information Processing Letters
Embedding a family of disjoint multi-dimensional meshes into a crossed cube
Information Processing Letters
Fault-tolerant embedding of paths in crossed cubes
Theoretical Computer Science
The bipancycle-connectivity of the hypercube
Information Sciences: an International Journal
On embedding subclasses of height-balanced trees in hypercubes
Information Sciences: an International Journal
Constructing the nearly shortest path in crossed cubes
Information Sciences: an International Journal
Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
Computers & Mathematics with Applications
Strongly Hamiltonian laceability of the even k-ary n-cube
Computers and Electrical Engineering
Path embeddings in faulty 3-ary n-cubes
Information Sciences: an International Journal
The panconnectivity and the pancycle-connectivity of the generalized base-b hypercube
The Journal of Supercomputing
Embedding a long fault-free cycle in a crossed cube with more faulty nodes
Information Processing Letters
Embedding meshes/tori in faulty crossed cubes
Information Processing Letters
Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges
Information Sciences: an International Journal
Fault-tolerant edge-pancyclicity of locally twisted cubes
Information Sciences: an International Journal
Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube
Information Sciences: an International Journal
Geodesic pancyclicity and balanced pancyclicity of the generalized base-b hypercube
Discrete Applied Mathematics
Embedding of hypercubes into necklace, windmill and snake graphs
Information Processing Letters
Geodesic pancyclicity of twisted cubes
Information Sciences: an International Journal
Panconnectivity of n-dimensional torus networks with faulty vertices and edges
Discrete Applied Mathematics
Two spanning disjoint paths with required length in generalized hypercubes
Theoretical Computer Science
| Hi-index | 0.07 |
Crossed cubes are popular variants of hypercubes. In this paper, we study path embeddings between any two distinct nodes in crossed cubes. We prove two important results in the n-dimensional crossed cube: (a) for any two nodes, all paths whose lengths are greater than or equal to the distance between the two nodes plus 2 can be embedded between the two nodes with dilation 1; (b) for any two integers n=2 and l with 1=