IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v446y2023ics0096300323000437.html
   My bibliography  Save this article

Reliabilities for two kinds of graphs with smaller diameters

Author

Listed:
  • Wang, Yihong
  • Meng, Jixiang
  • Fan, Jianxi

Abstract

Two crucial parameters to be considered when evaluating a network’s reliability are its connectivity and diagnosability. The connectivity of a graph is defined as the smallest number of vertices that, if removed, would leave a disconnected or single-vertex graph. The diagnosability is the maximum number of faulty vertices that the system can correctly identify. In this paper, aim to obtain the reliability of various graphs (e.g. interconnection networks and data center networks), we propose two kinds of graphs (resp. networks)—matching recursive graphs (MRGs) and recursive networks based on connected graphs (RNCGs). We prove that these two kinds of graphs have smaller diameters. Furthermore, we study their reliabilities, including connectivities and diagnosabilities. Moreover, we also extend our results to many graphs.

Suggested Citation

  • Wang, Yihong & Meng, Jixiang & Fan, Jianxi, 2023. "Reliabilities for two kinds of graphs with smaller diameters," Applied Mathematics and Computation, Elsevier, vol. 446(C).
    • Handle: RePEc:eee:apmaco:v:446:y:2023:i:c:s0096300323000437
    DOI: 10.1016/j.amc.2023.127874
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323000437
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2023.127874?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Liu, Xuemei & Meng, Jixiang, 2021. "The k-restricted edge-connectivity of the data center network DCell," Applied Mathematics and Computation, Elsevier, vol. 396(C).
    2. Chen, Laihuan & Meng, Jixiang & Tian, Yingzhi & Liang, Xiaodong & Liu, Fengxia, 2018. "Connectivity of half vertex transitive digraphs," Applied Mathematics and Computation, Elsevier, vol. 316(C), pages 25-29.
    3. Li, Xiaowang & Zhou, Shuming & Ren, Xiangyu & Guo, Xia, 2021. "Structure and substructure connectivity of alternating group graphs," Applied Mathematics and Computation, Elsevier, vol. 391(C).
    4. Wang, Na & Meng, Jixiang & Tian, Yingzhi, 2022. "Reliability evaluation of Modified bubble-sort graph networks based on structure fault pattern," Applied Mathematics and Computation, Elsevier, vol. 430(C).
    5. Zhang, Guozhen & Wang, Dajin, 2019. "Structure connectivity and substructure connectivity of bubble-sort star graph networks," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    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. Wang, Na & Meng, Jixiang & Tian, Yingzhi, 2022. "Reliability evaluation of Modified bubble-sort graph networks based on structure fault pattern," Applied Mathematics and Computation, Elsevier, vol. 430(C).
    2. Ba, Lina & Zhang, Heping, 2023. "Structure connectivity of data center networks," Applied Mathematics and Computation, Elsevier, vol. 451(C).
    3. Zhang, Guozhen & Wang, Dajin, 2021. "The structure fault tolerance of arrangement graphs," Applied Mathematics and Computation, Elsevier, vol. 400(C).
    4. Lei, Yafei & Meng, Jixiang, 2020. "Structure Fault-tolerance of Arrangement Graphs," Applied Mathematics and Computation, Elsevier, vol. 381(C).
    5. Liu, Xuemei & Meng, Jixiang & Sabir, Eminjan, 2023. "Component connectivity of the data center network DCell," Applied Mathematics and Computation, Elsevier, vol. 444(C).
    6. Wei Feng & Shiying Wang, 2020. "The Diagnosability of Wheel Networks with Missing Edges under the Comparison Model," Mathematics, MDPI, vol. 8(10), pages 1-16, October.
    7. Cheng, Dongqin, 2022. "Two disjoint cycles of various lengths in alternating group graph," Applied Mathematics and Computation, Elsevier, vol. 433(C).
    8. Li, Xiaowang & Zhou, Shuming & Ren, Xiangyu & Guo, Xia, 2021. "Structure and substructure connectivity of alternating group graphs," Applied Mathematics and Computation, Elsevier, vol. 391(C).

    More about this item

    Keywords

    Reliability; MRG; RNCG; Hypercube; DCell;
    All these keywords.

    Statistics

    Access and download statistics

    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:eee:apmaco:v:446:y:2023:i:c:s0096300323000437. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.