Extra connectivity, diagnosability, and conditional diagnosability are all important measures
for a multiprocessor system's ability to diagnose and tolerate faults. In this paper, we analyze …

Connectivity is a classic measure for fault tolerance of a network in the case of vertices
failures. Extra connectivity and restricted connectivity are two important indicators of the …

Traditional data center networks (DCNs) are faced with many challenges with the
development of cloud computing. This fact makes design of new DCNs represented by …

Abstract Let S⊆ V (G) and κ G (S) denote the maximum number r of edge-disjoint trees T 1,
T 2,…, T r in G such that V (T i)⋂ V (T j)= S for any i, j∈{1, 2,…, r} and i≠ j. For an integer k …

Fault diagnosis of processors has played an essential role when evaluating the reliability of
multiprocessor systems. In many novel multiprocessor systems, their diagnosability has …

The conditional diagnosability and the 2-extra connectivity are two important parameters to
measure ability of diagnosing faulty processors and fault-tolerance in a multiprocessor …

The-diagnosis strategy can significantly enhance the system's self-diagnosing capability at
the expense of no more than fault-free processors (vertices) being mistakenly diagnosed as …

Given a graph G and a non-negative integer h, the h-restricted connectivity of G, denoted by
κ h (G), is defined as the minimum size of a set X of nodes in G (X⊂ V (G)) such that G− X is …

Given a graph G and non-negative integer h, the h-restricted connectivity of G is the
minimum cardinality of a set of nodes in G, if exists, whose deletion disconnects G and the …

For a graph G=(V, E), a subset F⊆ V (G) is called an Rk-vertex-cut of G if G− F is
disconnected and each vertex u∈ V (G)− F has at least k neighbors in G− F. The Rk-vertex …