Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes

DOI10.1016/j.ic.2013.07.001zbMath1339.68028OpenAlexW2032713348MaRDI QIDQ391635

Ruixia Wang, Jing Li, Shang-Wei Lin, Shi-ying Wang

Publication date: 10 January 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2013.07.001

zbMATH Keywords

torusinterconnection networksfault-tolerancecycle embedding\(k\)-ary \(n\)-cubes

Mathematics Subject Classification ID

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

Related Items (3)

Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges ⋮ Odd cycles embedding on folded hypercubes with conditional faulty edges ⋮ Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes

Cites Work

• Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks
• Path embeddings in faulty 3-ary \(n\)-cubes
• Cycles embedding in hypercubes with node failures
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Weak-vertex-pancyclicity of (\(n,k\))-star graphs
• Edge-bipancyclicity of a hypercube with faulty vertices and edges
• Fault-tolerant cycles embedded in hypercubes with mixed link and node failures
• The bipancycle-connectivity of the hypercube
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Linear array and ring embeddings in conditional faulty hypercubes
• The achievement of knowledge bases by cycle search.
• Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
• On embedding cycles into faulty twisted cubes
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes

This page was built for publication: Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes