Wide diameters of de Bruijn graphs

DOI10.1007/s10878-007-9066-4zbMath1133.05027OpenAlexW2037152225MaRDI QIDQ2471070

Jyhmin Kuo, Hung-Lin Fu

Publication date: 18 February 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9066-4

zbMATH Keywords

de BruijnInternally disjoint pathWide diameter

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Related Items (1)

ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS

Cites Work

• On the connectivity of the De Bruijn graph
• Wide diameters of butterfly networks
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks

This page was built for publication: Wide diameters of de Bruijn graphs