The Diagnosability of ( K 4 – { e })-free Graphs under the PMC Diagnosis Model

Abstract

The ability of identifying all the faulty devices in a multiprocessor system is known as diagnosability. The PMC model is the test-based diagnosis with a processor performing the diagnosis by testing the neighboring processors via the links between them. In this paper, we discuss the diagnosability of a (K₄ – {e})-free graph under the PMC model.