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
The linear-array problem in communication complexity resolved
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Edge Congestion and Topological Properties of Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
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-tolerant cycle-emebedding of crossed cubes
Information Processing Letters
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Paths in Möbius cubes and crossed cubes
Information Processing Letters
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed Computing
The bipanconnectivity and m-panconnectivity of the folded hypercube
Theoretical Computer Science
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m,4)
Theoretical Computer Science
Edge-bipancyclicity of a hypercube with faulty vertices and edges
Discrete Applied Mathematics
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
Complete path embeddings in crossed cubes
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
Embedding multi-dimensional meshes into twisted cubes
Computers and Electrical Engineering
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance
The Journal of Supercomputing
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences: an International Journal
Embedding meshes into twisted-cubes
Information Sciences: an International Journal
Theoretical Computer Science
Fault tolerance in bubble-sort graph networks
Theoretical Computer Science
Embedding a mesh of trees in the crossed cube
Information Processing Letters
Fault tolerance in k-ary n-cube networks
Theoretical Computer Science
Hi-index | 5.23 |
The crossed cube CQ"n is an important variant of the hypercube Q"n and possesses many desirable properties for interconnection networks. This paper shows that in CQ"n with f"v faulty vertices and f"e faulty edges there exists a fault-free path of length @? between any two distinct fault-free vertices for each @? satisfying 2^n^-^1-1@?@?@?2^n-f"v-1 provided that f"v+f"e@?n-3, where the lower bound of @? and the upper bound of f"v+f"e are tight for some n. Moreover, this result improves the known result that CQ"n is (n-3)-Hamiltonian connected.