On Diagnosability of Large Fault Sets in Regular Topology-Based Computer Systems
IEEE Transactions on Computers
Diagnosability of the Möbius Cubes
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model
IEEE Transactions on Computers
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model
IEEE Transactions on Parallel and Distributed Systems
The t/k-Diagnosability of the BC Graphs
IEEE Transactions on Computers
Diagnosabilities of Regular Networks
IEEE Transactions on Parallel and Distributed Systems
(t,k)-Diagnosis for Matching Composition Networks
IEEE Transactions on Computers
An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs
IEICE - Transactions on Information and Systems
($t$,$k$)-Diagnosability of Multiprocessor Systems with Applications to Grids and Tori
SIAM Journal on Computing
Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model
IEEE Transactions on Computers
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
Information Sciences: an International Journal
Diagnosability of star graphs under the comparison diagnosis model
Information Processing Letters
| Hi-index | 0.00 |
A system is t/t-diagnosable if, given any collection of test results, the faulty nodes can be isolated to within a set of at most t nodes provided that the number of faulty nodes does not exceed t. Given an N-vertex graph G that is regular with the common degree d and has no cycle of three or four vertices, this study shows that G is (2d − 2)/(2d − 2)-diagnosable if N ≥ 4d − 30 0. Based on this result, the t/t-diagnosabilities of several classes of graphs can be computed efficiently.