The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM\(^\ast\) model
Publication:266281
DOI10.1016/j.tcs.2016.03.019zbMath1338.68036OpenAlexW2304255880MaRDI QIDQ266281
Mujiangshan Wang, Yu-qing Lin, Shi-ying Wang
Publication date: 13 April 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.03.019
Cayley graphinterconnection networkdiagnosability2-good-neighbor diagnosabilityMM\(^\ast\) modelPMC model
Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (21)
Cites Work
- Unnamed Item
- Unnamed Item
- The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
- Diagnosability of Cayley graphs generated by transposition trees with missing edges
- Orienting Cayley graphs generated by transposition trees
- Bipancyclic properties of Cayley graphs generated by transpositions
- A kind of conditional vertex connectivity of star graphs
- Conditional connectivity of Cayley graphs generated by transposition trees
- Diameters of Cayley graphs generated by transposition trees
- Linearly many faults in Cayley graphs generated by transposition trees
- An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
- A group-theoretic model for symmetric interconnection networks
- Strong Diagnosability and Conditional Diagnosability of Multiprocessor Systems and Folded Hypercubes
- On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
This page was built for publication: The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM\(^\ast\) model