The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model
DOI10.1080/00207160.2015.1119817zbMath1362.05062OpenAlexW2310403565MaRDI QIDQ5737885
Mujiangshan Wang, Yubao Guo, Shi-ying Wang
Publication date: 30 May 2017
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2015.1119817
Cayley graphinterconnection networkdiagnosabilityPMC model\(\mathrm{MM}^\ast\) model1-good-neighbour diagnosability
Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
Cites Work
- 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
- Diagnosability of star graphs under the comparison diagnosis model
- 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
- Conditional fault tolerance in a class of Cayley graphs
- An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
- A group-theoretic model for symmetric interconnection networks
- The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model