IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v531y2026ics009630032600233x.html

Fault tolerability analysis of folded Petersen networks on the basis of l-extra edge-connectivity

Author

Listed:
  • Xu, Liqiong
  • Chen, Mengfan
  • Wu, Xuemin
  • Zhou, Shuming

Abstract

Analyzing fault tolerance is critical not only for designing but also for maintaining multiprocessor systems. Serving as a generalized form of conventional (edge-)connectivity, the l-extra (edge-)connectivity enables a more precise evaluation of fault tolerance in multiprocessor systems. For numerous important multiprocessor architectures, calculating l-extra (edge-)connectivity, particularly for larger l, remains an unresolved research question. The n-dimensional folded Petersen network Pn has emerged as a leading candidate for multiprocessor system topologies. This paper is concerned with examining the l-extra edge-connectivity of Pn, λl(Pn), where the integers l∈[1,5·10n−1]. In more detail, we show that λl(Pn) for roughly two-thirds of integers l in [1,5·10n−1] (with (n ≥ 2) manifests a concentration phenomenon, and for integers l in [1,2n+1]∪[5·2n,6·2n] demonstrates a λl-optimal property. Moreover, the concentration property of the folded Petersen network can be generalized to the folded Petersen cube.

Suggested Citation

  • Xu, Liqiong & Chen, Mengfan & Wu, Xuemin & Zhou, Shuming, 2026. "Fault tolerability analysis of folded Petersen networks on the basis of l-extra edge-connectivity," Applied Mathematics and Computation, Elsevier, vol. 531(C).
    • Handle: RePEc:eee:apmaco:v:531:y:2026:i:c:s009630032600233x
    DOI: 10.1016/j.amc.2026.130181
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630032600233X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2026.130181?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

    for a different version of it.

    More about this item

    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:531:y:2026:i:c:s009630032600233x. 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: 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.