%0 Journal Article
%T Reliability Analysis of the Bijective Connection Networks for Components
%J Mathematics | An Open Access Journal from MDPI
%D 2019
%R https://doi.org/10.3390/math7060546
%X 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. View Full-Tex
%U https://www.mdpi.com/2227-7390/7/6/546