On computing a conditional edge-connectivity of a graph
Information Processing Letters
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
Extraconnectivity of graphs with large girth
Discrete Mathematics - Special issue on graph theory and applications
Topological properties of the crossed cube architecture
Parallel Computing
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
Fault-tolerant cycle-emebedding of crossed cubes
Information Processing Letters
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Hamiltonian properties on the class of hypercube-like networks
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
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
(t,k)-Diagnosis for Matching Composition Networks
IEEE Transactions on Computers
On reliability of the folded hypercubes
Information Sciences: an International Journal
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Sciences: an International Journal
Embedding a family of disjoint 3D meshes into a crossed cube
Information Sciences: an International Journal
Conditional fault Hamiltonicity of the complete graph
Information Processing Letters
Embedding a family of disjoint multi-dimensional meshes into a crossed cube
Information Processing Letters
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Theoretical Computer Science
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
Theoretical Computer Science
Embedding a family of 2D meshes into Möbius cubes
WSEAS Transactions on Mathematics
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Information Sciences: an International Journal
Embedding fault-free cycles in crossed cubes with conditional link faults
The Journal of Supercomputing
Fault-Free Cycles in Conditional Faulty Folded Hypercubes
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Fault-Tolerant Hamiltonicity of Augmented Cubes under the Conditional Fault Model
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
An optimal result on fault-tolerant cycle-embedding in alternating group graphs
Information Processing Letters
Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links
Information Sciences: an International Journal
Two-node-Hamiltonicity of enhanced pyramid networks
Information Sciences: an International Journal
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Embedding a long fault-free cycle in a crossed cube with more faulty nodes
Information Processing Letters
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
Embedding meshes/tori in faulty crossed cubes
Information Processing Letters
Constructing edge-disjoint spanning trees in twisted cubes
Information Sciences: an International Journal
A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
Information Sciences: an International Journal
Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
Information Sciences: an International Journal
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
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences: an International Journal
Theoretical Computer Science
Hamiltonian cycle within extended OTIS-cube topology
ACELAE'11 Proceedings of the 10th WSEAS international conference on communications, electrical & computer engineering, and 9th WSEAS international conference on Applied electromagnetics, wireless and optical communications
Hamiltonicity of a general OTIS network
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Hamiltonian cycles in hypercubes with 2n-4 faulty edges
Information Sciences: an International Journal
Hamiltonian properties of honeycomb meshes
Information Sciences: an International Journal
| Hi-index | 0.08 |
The crossed cube, which is a variation of the hypercube, possesses some properties superior to the hypercube. In this paper, assuming that each node is incident with at least two fault-free links, we show that an n-dimensional crossed cube contains a fault-free Hamiltonian cycle, even if there are up to 2n-5 link faults. The result is optimal with respect to the number of link faults tolerated. We also verify that the assumption is practically meaningful by evaluating its occurrence probability, which is very close to 1.