Improving bounds on link failure tolerance of the star graph
From MaRDI portal
Publication:985078
DOI10.1016/J.INS.2010.03.002zbMATH Open1211.68293OpenAlexW2039545958MaRDI QIDQ985078FDOQ985078
Authors: J. Martínez
Publication date: 20 July 2010
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2010.03.002
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)
Cites Work
- A group-theoretic model for symmetric interconnection networks
- Hyper Hamiltonian laceability on edge fault star graph
- On the fault-diameter of the star graph
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs
- Robustness of star graph network under link failure
- Substar reliability analysis in star networks
- A study of fault tolerance in star graph
- Embedding an arbitrary binary tree into the star graph
- How robust is the n-cube?
- A fault-tolerant broadcast scheme in the star graph under the single-port, half-duplex communication model
Cited In (19)
- Subnetwork preclusion for bubble-sort networks
- Diagnosability of star graphs with missing edges
- \(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) model
- Independent spanning trees on even networks
- Subnetwork Preclusion of (n,k)-Star Networks
- Conditional diagnosability and strong diagnosability of split-star networks under the PMC model
- Conditional fault tolerance in a class of Cayley graphs
- Structure connectivity and substructure connectivity of star graphs
- The \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphs
- Conditional connectivity of star graph networks under embedding restriction
- Researches for more reliable arrangement graphs in multiprocessor computer system
- The preclusion numbers and edge preclusion numbers in a class of Cayley graphs
- The panpositionable panconnectedness of augmented cubes
- Measuring the impact of MVC attack in large complex networks
- Robustness of star graph network under link failure
- Link failure tolerance in the arrangement graphs
- Fault tolerance in bubble-sort graph networks
- The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks
- A study of fault tolerance in star graph
This page was built for publication: Improving bounds on link failure tolerance of the star graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985078)