A study of fault tolerance in star graph
From MaRDI portal
Publication:846005
DOI10.1016/j.ipl.2006.12.013zbMath1184.68115MaRDI 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
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Link Failure Tolerance in the Arrangement Graphs, Subnetwork Preclusion of (n,k)-Star Networks, The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks, Fault tolerance in \(k\)-ary \(n\)-cube networks, Fault tolerance in bubble-sort graph networks, The preclusion numbers and edge preclusion numbers in a class of Cayley graphs, The pessimistic diagnosabilities of some general regular graphs, On the construction of all shortest node-disjoint paths in star networks, Substar reliability analysis in star networks, Improving bounds on link failure tolerance of the star graph, The \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphs, \(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) model, Restricted connectivity of Cayley graph generated by transposition trees, Structure connectivity and substructure connectivity of wheel networks, Structure connectivity and substructure connectivity of bubble-sort star graph networks, Subnetwork preclusion for bubble-sort networks, On the problem of determining which \((n, k)\)-star graphs are Cayley graphs, Path and cycle fault tolerance of bubble-sort graph networks, Fault tolerance in the arrangement graphs, Robustness of star graph network under link failure, Conditional fault tolerance in a class of Cayley graphs
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
