Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults

DOI10.1016/J.TCS.2011.02.030zbMath1228.68013OpenAlexW2043424957MaRDI QIDQ650889

Shurong Zhang, Shi-ying Wang

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

zbMATH Keywords

Hamiltonian paths\(k\)-ary \(n\)-cubesconditional edge faultspath embeddings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (6)

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 ⋮ Edge-bipancyclicity in conditional edge-faulty k-ary n-cubes ⋮ Hamiltonian properties of honeycomb meshes ⋮ Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes ⋮ Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model

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

This page was built for publication: Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults