IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v23y2012i4d10.1007_s10878-010-9362-2.html
   My bibliography  Save this article

Fault-tolerant diameter for three family interconnection networks

Author

Listed:
  • Tongliang Shi

    (Tsinghua University)

  • Mei Lu

    (Tsinghua University)

Abstract

Let G=(V,E) be an k-connected graph. The (k−1)-fault-tolerant diameter of G, denoted by D k (G), is defined as D k (G)=max {d(G−F)|F⊂V(G) and |F|=k−1}, where G−F denotes the subgraph induced by V(G)−F. The fault-tolerant diameter is one important parameter for measuring the reliability and efficiency of interconnection networks. In this paper, we will give the bounds of fault-tolerant diameter of three family interconnection networks.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:23:y:2012:i:4:d:10.1007_s10878-010-9362-2
    DOI: 10.1007/s10878-010-9362-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-010-9362-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-010-9362-2?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.

    Citations

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


    Cited by:

    1. 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.
    2. 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:spr:jcomop:v:23:y:2012:i:4:d:10.1007_s10878-010-9362-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.