This paper shows that in the undirected binary de Bruijn graph of dimension n . UB(n), which has diameter n , there exist at least two internally vertex disjoint paths of length at most n between any two vertices. In other words, the 2-diameter of U B ( n ) is equal to its diameter n .
Wide diameters of de Bruijn graphs
β Scribed by Jyhmin Kuo; Hung-Lin Fu
- Publisher
- Springer US
- Year
- 2007
- Tongue
- English
- Weight
- 288 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1382-6905
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Given a Cartesian product G of nontrivial connected graphs G i and the n-dimensional base B de Bruijn graph D = D B (n), it is investigated whether or not G is a spanning subgraph of D. Special attention is given to graphs G 1 Γ β’ β’ β’ Γ G m which are relevant for parallel computing, namely, to
De Bruijn and Kautz graphs have been intensively studied as perspective interconnection networks of massively parallel computers. One of the crucial parameters of an interconnection network is its bisection width. It has an influence on both communication properties of the network and the algorithmi