The diagnosability of the k-ary n-cubes using the pessimistic strategy
DOI10.1080/00207160.2011.628386zbMATH Open1237.68032OpenAlexW2122816430MaRDI QIDQ2887017FDOQ2887017
Authors: Xinke Wang, Qiang Zhu, Ruitao Feng 
Publication date: 15 May 2012
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2011.628386
Recommendations
interconnection networksPMC modeltori\(k\)-ary \(n\)-cubespessimistic strategy\(t_1\)/\(t_1\)-diagnosability
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical problems of computer architecture (68M07)
Cites Work
- Graph theory with applications
- Diagnosability of enhanced hypercubes
- Lee distance and topological properties of k-ary n-cubes
- On diagnosability of large fault sets in regular topology-based computer systems
- Strongly Diagnosable Systems under the Comparison Diagnosis Model
- On Fault Identification in Diagnosable Systems
- On conditional diagnosability of the folded hypercubes
Cited In (9)
- The \(t/k\)-diagnosability of \(m\)-ary \(n\)-cube networks
- The pessimistic diagnosability of data center networks
- Reliability analysis of Cayley graphs generated by transpositions
- Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
- Reliability evaluation of complete graph-based recursive networks
- The local diagnosability of \(k\)-ary \(n\)-cube.
- The pessimistic diagnosability of three kinds of graphs
- The pessimistic diagnosabilities of some general regular graphs
- The \(t/m\)-diagnosis strategy of augmented \(k\)-ary \(n\)-cubes
This page was built for publication: The diagnosability of the \(k\)-ary \(n\)-cubes using the pessimistic strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2887017)
