Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes

DOI10.1016/J.TCS.2018.09.020zbMath1417.68166OpenAlexW2892674968WikidataQ129202111 ScholiaQ129202111MaRDI QIDQ1733044

Yuxing Yang, Shi-ying Wang, Jing Li

Publication date: 26 March 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.09.020

zbMATH Keywords

fault toleranceinterconnection networksHamiltonian pathsmultiprocessor systemsprescribed linear forests

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (5)

Matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges ⋮ Fault-tolerant-prescribed Hamiltonian laceability of balanced hypercubes ⋮ Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks ⋮ Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links

Cites Work

• Unnamed Item
• Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges
• Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
• Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
• Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges
• Path embeddings in faulty 3-ary \(n\)-cubes
• Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
• Hamiltonian paths and cycles passing through a prescribed path in hypercubes
• Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
• Hamiltonian paths with prescribed edges in hypercubes
• Cycles passing through prescribed edges in a hypercube with some faulty edges
• Panconnectivity and edge-pancyclicity ofk-aryn-cubes
• Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
• Lee distance and topological properties of k-ary n-cubes
• Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes
• Hamiltonian Cycles with Prescribed Edges in Hypercubes

This page was built for publication: Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes