Theg-Good-Neighbor Conditional Diagnosability of Locally Exchanged Twisted Cubes
Huiqing Liu, Xiaolan Hu, Shan Gao · The Computer Journal · 2018
Connectivity and diagnosability are important parameters in measuring the fault tolerance and reliability of interconnection networks. The Rg-vertex-connectivity of a connected graph G is the minimum cardinality of a faulty set X⊆V(G) such that G−X is disconnected and every fault-free vertex has at least g fault-free neighbors. The g-good-neighbor conditional diagnosability is defined as the maximum cardinality of a g-good-neighbor conditional faulty set that the system can guarantee to identify. The interconnection network considered here is the locally exchanged twisted cube LeTQ(s,t). For 1≤s≤t and 0≤g≤s, we first determine the Rg-vertex-connectivity of LeTQ(s,t), then establish the g-good-neighbor conditional diagnosability of LeTQ(s,t) under the PMC model and MM* model, respectively.