Fault tolerance in \(k\)-ary \(n\)-cube networks

DOI10.1016/j.tcs.2012.06.013zbMath1252.68044OpenAlexW19257746MaRDI QIDQ690475

Kai Feng, Guozhen Zhang, Shi-ying Wang

Publication date: 27 November 2012

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

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

zbMATH Keywords

fault toleranceinterconnection networks\(k\)-ary \(n\)-cubesnode-failure

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

On the automorphism groups of us-Cayley graphs ⋮ Path and cycle fault tolerance of bubble-sort graph networks ⋮ Embedded edge connectivity of \(k\)-ary \(n\)-cubes ⋮ The reliability analysis of \(k\)-ary \(n\)-cube networks ⋮ Subnetwork Preclusion of (n,k)-Star Networks ⋮ Structure connectivity and substructure connectivity of wheel networks ⋮ Fault tolerance in the arrangement graphs ⋮ Structure connectivity and substructure connectivity of bubble-sort star graph networks ⋮ Conditional fault tolerance in a class of Cayley graphs ⋮ Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes ⋮ The preclusion numbers and edge preclusion numbers in a class of Cayley graphs ⋮ Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks ⋮ Structure fault tolerance of \(k\)-ary \(n\)-cube networks ⋮ Subnetwork preclusion for bubble-sort networks

Cites Work

• Unnamed Item
• Unnamed Item
• Embedding longest fault-free paths onto star graphs with more vertex faults
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
• Fault tolerance in bubble-sort graph networks
• A note on edge fault tolerance with respect to hypercubes
• A study of fault tolerance in star graph
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Fault-tolerant embedding of paths in crossed cubes
• Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
• Fault-free longest paths in star networks with conditional link faults
• How robust is the n-cube?
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes

This page was built for publication: Fault tolerance in \(k\)-ary \(n\)-cube networks