Diagnosability of Cayley graphs generated by transposition trees with missing edges
From MaRDI portal
Publication:497146
DOI10.1016/j.ins.2013.03.009zbMath1320.68051OpenAlexW2018003574MaRDI QIDQ497146
Publication date: 23 September 2015
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.03.009
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 (12)
The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM\(^\ast\) model ⋮ The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs ⋮ The component connectivity, component diagnosability, and \(t/k\)-diagnosability of bicube networks ⋮ The Component Diagnosability of General Networks ⋮ Strong diagnosability and conditional diagnosability of optical multi-mesh hypercube networks under the PMC model ⋮ Neighbor connectivity of two kinds of Cayley graphs ⋮ The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model ⋮ Theg-extra conditional diagnosability and sequentialt/k-diagnosability of hypercubes ⋮ Measurement and algorithm for conditional local diagnosis of regular networks under the \(\mathrm{MM}^\ast\) model ⋮ Local diagnosability of bipartite graphs with conditional faulty edges under Preparata, Metze and Chien's model ⋮ Hybrid fault diagnosis capability analysis of triangle-free graphs ⋮ Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
Cites Work
This page was built for publication: Diagnosability of Cayley graphs generated by transposition trees with missing edges