Reliability Analysis of the Bijective Connection Networks for Components
L. B. Guo, Chia‐Wei Lee · Mathematics · 2019
Connectivity is a critical parameter that can measure the reliability of networks. Let Q ⊆ V ( G ) be a vertex set. If G − Q is disconnected and every component of G − Q contains at least k + 1 vertices, then Q is an extra-cut. The number of vertices in the smallest extra-cut is the extraconnectivity κ k ( G ) . Suppose ω ( G ) is the number of components of G and W ⊆ V ( G ) ; if ω ( G − W ) ≥ t , then w is a t-component cut of G. The number of vertices in the least t-component cut is the t-component connectivity c κ t ( G ) of G. The t-component edge connectivity c λ t ( G ) is defined similarly. In this note, we study the BC networks and obtain the t-component (edge) connectivity of bijective connection networks for some t.