𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


2-diameter of de Bruijn graphs
✍ Li, Qiao; Sotteau, Dominique; Xu, Junming πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 589 KB

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 .

Generalized de Bruijn graphs
✍ F. M. Malyshev; V. E. Tarakanov πŸ“‚ Article πŸ“… 1997 πŸ› SP MAIK Nauka/Interperiodica 🌐 English βš– 606 KB
Embedding Cartesian Products of Graphs i
✍ Thomas Andreae; Michael NΓΆlle; Gerald Schreiber πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 172 KB

## 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

Bisecting de Bruijn and Kautz graphs
✍ JosΓ© Rolim; Pavel Tvrdik; Jan Trdlička; Imrich Vrto πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 675 KB

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

Spanners of de Bruijn and Kautz graphs
✍ Rabah Harbane; Carles PadrΓ³ πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 530 KB