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

Reliability Analysis of ( n , k )-Bubble-Sort Networks Based on Extra Conditional Fault

Author

Listed:
  • Lina Zhao

    (School of Mathematics and Computer Science, Shanxi Normal University, Taiyuan 030031, China)

  • Shiying Wang

    (School of Mathematics and Computer Science, Shanxi Normal University, Taiyuan 030031, China)

  • Feng Dou

    (School of Mathematics and Computer Science, Shanxi Normal University, Taiyuan 030031, China)

Abstract

Given a graph G = ( V ( G ) , V ( E ) ) , a non-negative integer g and a set of faulty vertices F ⊆ V ( G ) , the g -extra connectivity of G , denoted by κ g ( G ) , is the smallest cardinality of F , whose value of deletion, if exists, will disconnect G and give each remaining component at least g + 1 vertices. The g -extra diagnosability of the graph G , denoted by t g ( G ) , is the maximum cardinality of the set F of fault vertices that the graph can guarantee to identify under the condition that each fault-free component has more than g vertices. In this paper, we determine that g -extra connectivity of ( n , k ) -bubble-sort network B n , k is κ g ( B n , k ) = n + g ( k − 2 ) − 1 for 4 ≤ k ≤ n − 1 and 0 ≤ g ≤ n − k . Afterwards, we show that g -extra diagnosability of B n , k under the PMC model ( 4 ≤ k ≤ n − 1 and 0 ≤ g ≤ n − k ) and MM* model ( 4 ≤ k ≤ n − 1 and 0 ≤ g ≤ min { n − k − 1 , k − 2 } ) is t g ( B n , k ) = n + g ( k − 1 ) − 1 , respectively.

Suggested Citation

  • Lina Zhao & Shiying Wang & Feng Dou, 2024. "Reliability Analysis of ( n , k )-Bubble-Sort Networks Based on Extra Conditional Fault," Mathematics, MDPI, vol. 12(18), pages 1-11, September.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:18:p:2939-:d:1482621
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/18/2939/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/18/2939/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Guo, Jia & Lu, Mei & Wang, Xin, 2022. "The (strong) structure connectivity and (strong) substructure connectivity of the (n,k)-bubble-sort network," Applied Mathematics and Computation, Elsevier, vol. 425(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Guo, Jia, 2023. "On strong Menger connectivity of (n,k)-bubble-sort networks," Applied Mathematics and Computation, Elsevier, vol. 458(C).

    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:12:y:2024:i:18:p:2939-:d:1482621. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.