Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults
From MaRDI portal
Publication:650889
DOI10.1016/j.tcs.2011.02.030zbMath1228.68013MaRDI QIDQ650889
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.030
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
68M07: Mathematical problems of computer architecture
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Edge-bipancyclicity in conditional edge-faulty k-ary n-cubes, Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model, Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges, Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes, Hamiltonian properties of honeycomb meshes, Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes
Cites Work
- Unnamed Item
- Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks
- A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- Cycle embedding in star graphs with conditional edge faults
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- Linear array and ring embeddings in conditional faulty hypercubes
- Edge-bipancyclicity of conditional faulty hypercubes
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
- Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes