The pessimistic diagnosability of three kinds of graphs
From MaRDI portal
Publication:516888
DOI10.1016/J.DAM.2016.09.033zbMath1358.05263OpenAlexW2530613566MaRDI QIDQ516888
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.033
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (6)
Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs ⋮ On \(g\)-good-neighbor conditional connectivity and diagnosability of hierarchical star networks ⋮ Conditional diagnosability of multiprocessor systems based on complete-transposition graphs ⋮ Structure fault-tolerance of arrangement graphs ⋮ Reliability evaluation of complete graph-based recursive networks ⋮ Reliability analysis of Cayley graphs generated by transpositions
Cites Work
- Hamiltonian cycle embedding for fault tolerance in balanced hypercubes
- Fault-tolerance of \((n, k)\)-star networks
- Fault isolation and identification in general biswapped networks under the PMC diagnostic model
- Conditional diagnosability of arrangement graphs under the PMC model
- The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model
- The pessimistic diagnosability of alternating group graphs under the PMC model
- Fault diagnosability of arrangement graphs
- Various cycles embedding in faulty balanced hypercubes
- Bipanconnectivity of balanced hypercubes
- The pessimistic diagnosabilities of some general regular graphs
- Arrangement graphs: A class of generalized star graphs
- The \((n,k)\)-star graph: A generalized star graph
- A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
- On the arrangement graph.
- The diagnosability of thek-aryn-cubes using the pessimistic strategy
- The $t/k$-Diagnosability of Star Graph Networks
- On Fault Identification in Diagnosable Systems
- A Quick Pessimistic Diagnosis Algorithm for Hypercube-Like Multiprocessor Systems under the PMC Model
- Conditional Diagnosability of Alternating Group Graphs
- Strong Diagnosability and Conditional Diagnosability of Multiprocessor Systems and Folded Hypercubes
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
This page was built for publication: The pessimistic diagnosability of three kinds of graphs