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

Fault tolerability evaluation for the component edge-connectivity of folded Petersen networks

Author

Listed:
  • Xu, Liqiong

Abstract

Analysis on the link fault tolerability of multiprocessor systems plays a significance role in designing and optimizing for multiprocessor systems. The component edge-connectivity, as a generalization of the classical edge-connectivity, is a considerable measurement for the analysis of the robustness of multiprocessor systems. The k-component edge-connectivity of a connected graph G, expressed by cλk(G), is the minimum cardinality of an edge set whose removal is disconnected and has at least k components in the resulting graph. The n-th cartesian product of the Petersen graph P, called as the n-dimensional folded Petersen network Pn, is one of the most appealing topologies for multiprocessor systems. In this paper, cλk(Pn) for 1≤k≤2n−1 are obtained.

Suggested Citation

  • Xu, Liqiong, 2024. "Fault tolerability evaluation for the component edge-connectivity of folded Petersen networks," Applied Mathematics and Computation, Elsevier, vol. 473(C).
    • Handle: RePEc:eee:apmaco:v:473:y:2024:i:c:s0096300324001450
    DOI: 10.1016/j.amc.2024.128673
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324001450
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.128673?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. Guo, Litao & Su, Guifu & Lin, Wenshui & Chen, Jinsong, 2018. "Fault tolerance of locally twisted cubes," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 401-406.
    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. Liu, Qinghai & Hong, Yanmei, 2019. "The reliability of lexicographic product digraphs," Applied Mathematics and Computation, Elsevier, vol. 358(C), pages 449-454.

    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:473:y:2024:i:c:s0096300324001450. 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.