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
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
Topological properties of twisted cube
Information Sciences: an International Journal
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
Bipanconnectivity of balanced hypercubes
Computers & Mathematics with Applications
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
Theoretical Computer Science
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
The Journal of Supercomputing
Hi-index | 0.89 |
The Mobius cube MQ"n and the crossed cube CQ"n are two important variants of the hypercube Q"n. This paper shows that for any two different vertices u and v in G@?{MQ"n,CQ"n} with n=3, there exists a uv-path of every length from d"G(u,v)+2 to 2^n-1 except for a shortest uv-path, where d"G(u,v) is the distance between u and v in G. This result improves some known results.