A note on cycle embedding in hypercubes with faulty vertices
From MaRDI portal
Publication:1944949
DOI10.1016/j.ipl.2011.03.002zbMath1260.68294MaRDI QIDQ1944949
Publication date: 28 March 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.03.002
68R05: Combinatorics in computer science
68R10: Graph theory (including graph drawing) in computer science
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Hamiltonian cycle embedding for fault tolerance in balanced hypercubes, Vertex-fault-tolerant cycles embedding in balanced hypercubes, Hamiltonian paths in hypercubes with local traps
Cites Work
- Unnamed Item
- Unnamed Item
- On ring embedding in hypercubes with faulty nodes and links
- Fault-tolerant cycle embedding in the hypercube
- Embedding a ring in a hypercube with both faulty links and faulty nodes
- Many-to-many disjoint paths in faulty hypercubes
- Cycles passing through a prescribed path in a hypercube with faulty edges
- On path bipancyclicity of hypercubes
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes
- Edge-fault-tolerant bipanconnectivity of hypercubes
- Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
- Survey on path and cycle embedding in some networks
- Edge-fault-tolerant edge-bipancyclicity of hypercubes
- Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
- Linear array and ring embeddings in conditional faulty hypercubes
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- Theory and Application of Graphs
- Hamiltonian-laceability of star graphs
- Edge fault tolerance in graphs
