A study of fault tolerance in star graph
From MaRDI portal
Publication:846005
DOI10.1016/j.ipl.2006.12.013zbMath1184.68115OpenAlexW2068391163MaRDI QIDQ846005
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.12.013
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 (21)
On the problem of determining which \((n, k)\)-star graphs are Cayley graphs ⋮ The \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphs ⋮ Path and cycle fault tolerance of bubble-sort graph networks ⋮ \(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) model ⋮ The pessimistic diagnosabilities of some general regular graphs ⋮ Subnetwork Preclusion of (n,k)-Star Networks ⋮ On the construction of all shortest node-disjoint paths in star networks ⋮ Structure connectivity and substructure connectivity of wheel networks ⋮ Fault tolerance in the arrangement graphs ⋮ Substar reliability analysis in star networks ⋮ Robustness of star graph network under link failure ⋮ The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks ⋮ Fault tolerance in \(k\)-ary \(n\)-cube networks ⋮ Improving bounds on link failure tolerance of the star graph ⋮ Structure connectivity and substructure connectivity of bubble-sort star graph networks ⋮ Conditional fault tolerance in a class of Cayley graphs ⋮ Fault tolerance in bubble-sort graph networks ⋮ The preclusion numbers and edge preclusion numbers in a class of Cayley graphs ⋮ Link Failure Tolerance in the Arrangement Graphs ⋮ Restricted connectivity of Cayley graph generated by transposition trees ⋮ Subnetwork preclusion for bubble-sort networks
Cites Work
- Hyper Hamiltonian laceability on edge fault star graph
- On the fault-diameter of the star graph
- A group-theoretic model for symmetric interconnection networks
- Embedding an arbitrary binary tree into the star graph
- A fault-tolerant broadcast scheme in the star graph under the single-port, half-duplex communication model
This page was built for publication: A study of fault tolerance in star graph
