The cyclic diagnosability of Cayley graphs generated by transposition triangle-free unicyclic graphs under the PMC and MM∗ models

Diagnosability is a critical parameter for evaluating the reliability and self-diagnostic capacity of multiprocessor systems. As an advanced extension of traditional diagnosability, cyclic diagnosability has been proposed to enable more comprehensive assessment of the diagnostic capabilities of interconnection networks. In this paper, we prove that under both the PMC and MM ∗ models, the cyclic diagnosability of Cayley graphs generated by triangle-free unicyclic graphs is 5 n − 10 for n ≥ 11 .