pith. sign in

arxiv: 1807.08846 · v1 · pith:WEAS7PXKnew · submitted 2018-07-23 · 🧮 math.CO

The g-good neighbor conditional diagnosability of locally exchanged twisted cubes

classification 🧮 math.CO
keywords conditionaldiagnosabilityletqcardinalityexchangedfault-freefaultygood
0
0 comments X
read the original abstract

Connectivity and diagnosability are important parameters in measuring the fault tolerance and reliability of interconnection networks. The $R^g$-vertex-connectivity of a connected graph $G$ is the minimum cardinality of a faulty set $X\subseteq 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\leq s\leq t$ and $0\leq g\leq s$, we first determine the $R^g$-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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.