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

Conditional diagnosability of the SPn graphs under the comparison diagnosis model

Author

Listed:
  • Guo, Jia
  • Lu, Mei

Abstract

The conditional diagnosability of a system refers to the maximum cardinality of the conditional faulty sets can be identified by the system. The problem of conditional diagnosability is discussed widely. In this paper, we analyze the extra connectivities and the conditional diagnosability of a family of networks, called the SPn graphs. Applying the result, we determine the g-extra connectivity (1 ≤ g ≤ 3) and the conditional diagnosability of the star graphs and the pancake graphs under the comparison diagnosis model, respectively.

Suggested Citation

  • Guo, Jia & Lu, Mei, 2018. "Conditional diagnosability of the SPn graphs under the comparison diagnosis model," Applied Mathematics and Computation, Elsevier, vol. 336(C), pages 249-256.
    • Handle: RePEc:eee:apmaco:v:336:y:2018:i:c:p:249-256
    DOI: 10.1016/j.amc.2018.05.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318304120
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.05.009?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. Tongliang Shi & Mei Lu, 2012. "Fault-tolerant diameter for three family interconnection networks," Journal of Combinatorial Optimization, Springer, vol. 23(4), pages 471-482, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhou, Qianru & Liu, Hai & Cheng, Baolei & Wang, Yan & Han, Yuejuan & Fan, Jianxi, 2024. "Fault tolerance of recursive match networks based on g-good-neighbor fault pattern," Applied Mathematics and Computation, Elsevier, vol. 461(C).

    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. Qiang Zhu & Guodong Guo & Wenliang Tang & Cun-Quan Zhang, 2016. "A diagnosis algorithm by using graph-coloring under the PMC model," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 960-969, October.

    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:336:y:2018:i:c:p:249-256. 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.