Fault tolerance in k-ary n-cube networks
DOI10.1016/J.TCS.2012.06.013zbMATH Open1252.68044OpenAlexW19257746MaRDI QIDQ690475FDOQ690475
Authors: Guozhen Zhang, Kai Feng, Shiying 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
Recommendations
- The fault tolerance of \(k\)-ary \(n\)-cubes with respect to maximally local connectivity
- Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes
- Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes
- Unchanging the diameter of \(k\)-ary \(n\)-cube networks with faulty vertices
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
- Embedding longest fault-free paths onto star graphs with more vertex faults
- Fault-tolerant embedding of paths in crossed cubes
- Fault-free longest paths in star networks with conditional link faults
- Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
- Fault tolerance in bubble-sort graph networks
- A study of fault tolerance in star graph
- How robust is the n-cube?
- A note on edge fault tolerance with respect to hypercubes
Cited In (25)
- Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes
- Subnetwork preclusion for bubble-sort networks
- Fault tolerance in the arrangement graphs
- Fault-tolerant panconnectivity of augmented cubes
- Structure fault tolerance of WK-recursive networks
- Structure fault tolerance of \(k\)-ary \(n\)-cube networks
- Reliability analysis and fault tolerance for hypercube multi-computer networks
- Structure connectivity and substructure connectivity of wheel networks
- Subnetwork Preclusion of (n,k)-Star Networks
- Incomplete \(k\)-ary \(n\)-cube and its derivatives.
- Conditional fault tolerance in a class of Cayley graphs
- On the automorphism groups of us-Cayley graphs
- Path and cycle fault tolerance of bubble-sort graph networks
- The fault tolerance of \(( n , k )\)-bubble-sort networks
- Fault-tolerant cube graphs and coding theory
- Unchanging the diameter of \(k\)-ary \(n\)-cube networks with faulty vertices
- The reliability analysis of \(k\)-ary \(n\)-cube networks
- A lower bound on the size of \(k\)-neighborhood in generalized 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
- Embedded edge connectivity of \(k\)-ary \(n\)-cubes
- Structure connectivity and substructure connectivity of bubble-sort star graph networks
- The fault tolerance of \(k\)-ary \(n\)-cubes with respect to maximally local connectivity
- A NEW FAULT-TOLERANT ROUTING ALGORITHM FOR k-ARY n-CUBE NETWORKS
- Fault tolerance of Möbius cubes under two forbidden fault set models
This page was built for publication: Fault tolerance in \(k\)-ary \(n\)-cube networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690475)
