Reliability Analysis of the Bijective Connection Networks for Components

Litao Guo and Chia-Wei Lee
Additional contact information
Litao Guo: Department of Mathematics, Xiamen University of Technology, Xiamen 361024, China
Chia-Wei Lee: Department of Computer Science and Information Engineering, National Taitung University, No. 369, Sec. 2, University Road, Taitung City 95092, Taiwan

Mathematics, 2019, vol. 7, issue 6, 1-6

Abstract: 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 .

Keywords: networks; component; fault tolerance; BC networks (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/7/6/546/pdf (application/pdf)
https://www.mdpi.com/2227-7390/7/6/546/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:7:y:2019:i:6:p:546-:d:240045

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().