Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links

DOI10.1016/J.INS.2009.09.002zbMath1183.68089OpenAlexW2066050542MaRDI QIDQ845346

Xiaofan Yang, Qiang Dong, Da-Jin 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.002

zbMATH Keywords

cycleembeddingpathinterconnection networksfault-tolerance\(k\)-ary \(n\)-cube

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 (24)

Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges ⋮ Conditional edge-fault pancyclicity of augmented cubes ⋮ Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees ⋮ Complete binary trees embeddings in Möbius cubes ⋮ The reliability analysis of \(k\)-ary \(n\)-cube networks ⋮ Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges ⋮ Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements ⋮ Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs ⋮ Geodesic pancyclicity of twisted cubes ⋮ Pancyclicity of ternary \(n\)-cube networks under the conditional fault model ⋮ Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes ⋮ Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph ⋮ Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes ⋮ A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes ⋮ A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube ⋮ Various cycles embedding in faulty balanced hypercubes ⋮ Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges ⋮ Embedding meshes into twisted-cubes ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ Pancyclicity and bipancyclicity of conditional faulty folded hypercubes ⋮ The panpositionable panconnectedness of augmented cubes ⋮ Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges ⋮ Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks ⋮ Structure fault tolerance of \(k\)-ary \(n\)-cube networks

Cites Work

• Unnamed Item
• Many-to-many disjoint paths in faulty hypercubes
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• Edge-fault-tolerant bipanconnectivity of hypercubes
• Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
• Long paths in hypercubes with conditional node-faults
• Hamiltonian connectivity of the WK-recursive network with faulty nodes
• Embedding a fault-free Hamiltonian cycle in a class of faulty generalized honeycomb tori
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Lee distance and topological properties of k-ary n-cubes
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes

This page was built for publication: Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links