Wide diameters of de Bruijn graphs

Title:	Wide diameters of de Bruijn graphs
Authors:	Kuo, Jyhmin Fu, Hung-Lin 應用數學系 Department of Applied Mathematics
Keywords:	de Bruijn;internally disjoint path;wide diameter
Issue Date:	1-Oct-2007
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.
URI:	http://dx.doi.org/10.1007/s10878-007-9066-4 http://hdl.handle.net/11536/3996
ISSN:	1382-6905
DOI:	10.1007/s10878-007-9066-4
Journal:	JOURNAL OF COMBINATORIAL OPTIMIZATION
Volume:	14
Issue:	2-3
Begin Page:	143
End Page:	152
Appears in Collections:	Conferences Paper

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

APA	Kuo, J., & Fu, H. (2007). Wide diameters of de Bruijn graphs. WOS:000248864800005.
Bibtex	@article{Kuo2007Wide, title={Wide diameters of de Bruijn graphs}, author={Kuo, Jyhmin and Fu, Hung-Lin}, journal={WOS:000248864800005}, year={2007}, url={https://ir.lib.nycu.edu.tw/handle/11536/3996}, }