A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube

DOI10.1016/J.INS.2014.10.034zbMath1407.68377OpenAlexW2077310380MaRDI QIDQ527186

Yuxing Yang, Shi-ying Wang

Publication date: 16 May 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.10.034

zbMATH Keywords

Hamiltonian cycleHamiltonian pathinterconnection networkparallel system3-ary \( n\)-cube

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees ⋮ Hamiltonian paths passing through prescribed edges in balanced hypercubes ⋮ Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes

Cites Work

• Unnamed Item
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• Path embeddings in faulty 3-ary \(n\)-cubes
• Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges

This page was built for publication: A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube