Cycles passing through a prescribed path in a hypercube with faulty edges
From MaRDI portal
Publication:765497
DOI10.1016/J.IPL.2010.05.015zbMath1234.68018OpenAlexW1986370088MaRDI QIDQ765497
Publication date: 19 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.015
Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (6)
Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions ⋮ Matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ A note on cycle embedding in hypercubes with faulty vertices ⋮ Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph ⋮ The 2-path-bipanconnectivity of hypercubes ⋮ Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
Cites Work
- Unnamed Item
- Unnamed Item
- Path bipancyclicity of hypercubes
- Edge-bipancyclicity of a hypercube with faulty vertices and edges
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- On path bipancyclicity of hypercubes
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes
- Path embedding in faulty hypercubes
- Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
- Survey on path and cycle embedding in some networks
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- Edge-bipancyclicity of conditional faulty hypercubes
- Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
This page was built for publication: Cycles passing through a prescribed path in a hypercube with faulty edges
