The diagnosability and 1-good-neighbor conditional diagnosability of hypercubes with missing links and broken-down nodes
From MaRDI portal
Publication:1739213
DOI10.1016/j.ipl.2019.01.007zbMath1478.68021OpenAlexW2915014629WikidataQ128492204 ScholiaQ128492204MaRDI QIDQ1739213
Publication date: 26 April 2019
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2019.01.007
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (3)
Diagnosability and hybrid diagnosability of some classes of graphs under the BPMC model ⋮ Diagnosability for two families of composition networks ⋮ \(r\)-component diagnosability of hypercubes under the PMC model
Cites Work
- The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model
- On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
- 1-Perfect Codes Over Dual-Cubes vis-à-vis Hamming Codes Over Hypercubes
- The $t/k$-Diagnosability of Star Graph Networks
- An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
- Characterization of Connection Assignment of Diagnosable Systems
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
This page was built for publication: The diagnosability and 1-good-neighbor conditional diagnosability of hypercubes with missing links and broken-down nodes