IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i6p546-d240045.html
   My bibliography  Save this article

Reliability Analysis of the Bijective Connection Networks for Components

Author

Listed:
  • Litao Guo

    (Department of Mathematics, Xiamen University of Technology, Xiamen 361024, China
    The authors contributed equally to this work.)

  • Chia-Wei Lee

    (Department of Computer Science and Information Engineering, National Taitung University, No. 369, Sec. 2, University Road, Taitung City 95092, Taiwan
    The authors contributed equally to this work.)

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 .

Suggested Citation

  • Litao Guo & Chia-Wei Lee, 2019. "Reliability Analysis of the Bijective Connection Networks for Components," Mathematics, MDPI, vol. 7(6), pages 1-6, June.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:6:p:546-:d:240045
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/6/546/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/6/546/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:7:y:2019:i:6:p:546-:d:240045. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.