Diagnosability of star graphs with missing edges
Publication:454954
DOI10.1016/J.INS.2011.11.012zbMath1257.68042OpenAlexW2149530815MaRDI QIDQ454954
Jimmy J. M. Tan, Chieh-Feng Chiang, Lun-Min Shih, Guo-Huang Hsu
Publication date: 2 October 2012
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2011.11.012
star graphcomparison diagnosis modellocal diagnosability\(\text{MM}^{\ast }\) diagnosis modelextended star structurestrong local diagnosability property
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (16)
Cites Work
- Hyper Hamiltonian laceability on edge fault star graph
- Diagnosability of star graphs under the comparison diagnosis model
- Improving bounds on link failure tolerance of the star graph
- On the fault-diameter of the star graph
- Linearly many faults in Cayley graphs generated by transposition trees
- Robustness of star graph network under link failure
- Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model
- Using Node Diagnosability to Determine t-Diagnosability under the Comparison Diagnosis Model
- Strongly Diagnosable Systems under the Comparison Diagnosis Model
- On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
This page was built for publication: Diagnosability of star graphs with missing edges