Fault-tolerant diameter for three family interconnection networks

Tongliang Shi () and Mei Lu ()
Additional contact information
Tongliang Shi: Tsinghua University
Mei Lu: Tsinghua University

Journal of Combinatorial Optimization, 2012, vol. 23, issue 4, No 6, 482 pages

Abstract: 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.

Keywords: Diameter; Fault-tolerant diameter; Interconnection networks (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-010-9362-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:23:y:2012:i:4:d:10.1007_s10878-010-9362-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-010-9362-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().