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

DOI10.1016/J.TCS.2018.09.020MaRDI QIDQ1733044zbMATH OpenOpenAlexWikidataFDO

Authors Yuxing Yang, Jing Li, Shiying Wang

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 toleranceHamiltonian pathsinterconnection networksmultiprocessor systemsprescribed linear forests

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

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

Cited in

(10)

• 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
• Matchings extend to Hamiltonian cycles in hypercubes with faulty edges
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
• Embeddings of Hamiltonian paths in faulty k-ary 2-cubes
• Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges
• Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
• Hamiltonian laceability of hypercubes with prescribed linear forest and/or faulty edges
• Optimality for the restricted edge connectivity in exchanged ternary n-cubes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733044)