Embedding a long fault-free cycle in a crossed cube with more faulty nodes
From MaRDI portal
Publication:656607
DOI10.1016/j.ipl.2010.04.014zbMath1229.68007MaRDI QIDQ656607
Publication date: 18 January 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.04.014
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Vertex-fault-tolerant cycles embedding in balanced hypercubes, Hamiltonian properties of twisted hypercube-like networks with more faulty elements, MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
Cites Work
- Unnamed Item
- Fault-tolerant embedding of paths in crossed cubes
- Embedding a family of disjoint multi-dimensional meshes into a crossed cube
- Fault-tolerant cycle-embedding of crossed cubes
- Embedding a family of disjoint 3D meshes into a crossed cube
- Paths in Möbius cubes and crossed cubes
- Embedding meshes into crossed cubes
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Complete path embeddings in crossed cubes