Path embeddings in faulty 3-ary \(n\)-cubes

DOI10.1016/J.INS.2009.09.007zbMath1183.68093OpenAlexW2015612745MaRDI QIDQ845345

Shang-Wei Lin, Shi-ying Wang

Publication date: 28 January 2010

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

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

zbMATH Keywords

interconnection networksfault-tolerancepanconnectivity\(k\)-ary \(n\)-cubescycle embeddingspath embeddings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (21)

Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions ⋮ Matching preclusion for \(k\)-ary \(n\)-cubes ⋮ Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges ⋮ Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes ⋮ Connectivity and super connectivity of the exchanged 3-ary \(n\)-cube ⋮ Edge-bipancyclicity in conditional edge-faulty k-ary n-cubes ⋮ Geodesic pancyclicity of twisted cubes ⋮ Embedding long cycles in faulty \(k\)-ary \(2\)-cubes ⋮ Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes ⋮ Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph ⋮ Hamiltonian paths passing through prescribed edges in balanced hypercubes ⋮ Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes ⋮ A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube ⋮ Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges ⋮ 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 ⋮ Embedding meshes into twisted-cubes ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ Pancyclicity and bipancyclicity of conditional faulty folded hypercubes ⋮ Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes ⋮ Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes

Cites Work

• On the k-ary hypercube
• Longest fault-free paths in hypercubes with vertex faults
• Node-pancyclicity and edge-pancyclicity of crossed cubes
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• On rank vs. communication complexity
• Embedding meshes into crossed cubes
• Complete path embeddings in crossed cubes
• Lee distance and topological properties of k-ary n-cubes
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Mapping Cycles and Trees on Wrap-Around Butterfly Graphs

This page was built for publication: Path embeddings in faulty 3-ary \(n\)-cubes