Topological Properties of Hypercubes
IEEE Transactions on Computers
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
On the existence of Hamiltonian circuits in faulty hypercubes
SIAM Journal on Discrete Mathematics
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
Edge-pancyclic block-intersection graphs
Discrete Mathematics - Special volume: Designs and Graphs
Conditional fault diameter of star graph networks
Journal of Parallel and Distributed Computing
Connectivity of the crossed cube
Information Processing Letters
Edge Congestion and Topological Properties of Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
SIAM Journal on Discrete Mathematics
Combinatorial Analysis of the Fault-Diameter of the N-Cube
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
Edge-pancyclicity of coupled graphs
Discrete Applied Mathematics
Fault-tolerant cycle-emebedding of crossed cubes
Information Processing Letters
Edge-pancyclicity of recursive circulants
Information Processing Letters
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Conditional fault-tolerant hamiltonicity of star graphs
Parallel Computing
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Embedding meshes/tori in faulty crossed cubes
Information Processing Letters
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance
The Journal of Supercomputing
Pancyclicity of ternary n-cube networks under the conditional fault model
Information Processing Letters
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
SIAM Journal on Discrete Mathematics
ω-wide diameters of enhanced pyramid networks
Theoretical Computer Science
Embedding a mesh of trees in the crossed cube
Information Processing Letters
Nonflat surface level pyramid: a high connectivity multidimensional interconnection network
The Journal of Supercomputing
Hi-index | 0.00 |
The crossed cube, which is a variation of the hypercube, possesses some properties that are superior to those of the hypercube. In this paper, we show that with the assumption of each node incident with at least two fault-free links, an n-dimensional crossed cube with up to 2n驴5 link faults can embed, with dilation one, fault-free cycles of lengths ranging from 4 to 2 n . The assumption is meaningful, for its occurrence probability is very close to 1, and the result is optimal with respect to the number of link faults tolerated. Consequently, it is very probable that algorithms executable on rings of lengths ranging from 4 to 2 n can be applied to an n-dimensional crossed cube with up to 2n驴5 link faults.