Wide diameters of de Bruijn graphs

Jyhmin Kuo () and Hung-Lin Fu ()
Additional contact information
Jyhmin Kuo: NCTU
Hung-Lin Fu: NCTU

Journal of Combinatorial Optimization, 2007, vol. 14, issue 2, No 5, 143-152

Abstract: Abstract The wide diameter of a graph is an important parameter to measure fault-tolerance of interconnection network. This paper proves that for any two vertices in de Bruijn undirected graph UB(d,n), there are 2d−2 internally disjoint paths of length at most 2n+1. Therefore, the (2d−2)-wide diameter of UB(d,n) is not greater than 2n+1.

Keywords: de Bruijn; Internally disjoint path; Wide diameter (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9066-4 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:14:y:2007:i:2:d:10.1007_s10878-007-9066-4

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

DOI: 10.1007/s10878-007-9066-4

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 ().