A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
Information Processing Letters
Connectivity of the crossed cube
Information Processing Letters
Diagnosability of the Möbius Cubes
IEEE Transactions on Parallel and Distributed Systems
Topological properties of twisted cube
Information Sciences—Informatics and Computer Science: An International Journal
Edge Congestion and Topological Properties of Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Hamilton-connectivity and cycle-embedding of the Möbius cubes
Information Processing Letters
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
The Möbus Cubes: Improved Cubelike Networks for Parallel Computation
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
Fault-tolerant cycle-emebedding of crossed cubes
Information Processing Letters
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Embedding a family of disjoint 3D meshes into a crossed cube
Information Sciences: an International Journal
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
Constructing the nearly shortest path in crossed cubes
Information Sciences: an International Journal
Embedding geodesic and balanced cycles into hypercubes
WSEAS Transactions on Mathematics
Hi-index | 0.89 |
The Möbius cube MQn and the crossed cube CQn are two important variants of the hypercube Qn. This paper shows that for any two different vertices u and v in G ∈ {MQn, CQn} with n ≥ 3, there exists a uv-path of every length from dG(u, v) + 2 to 2n - 1 except for a shortest uv-path, where dG(u, v) is the distance between u and v in G. This result improves some known results.