2-diameter of de Bruijn graphs

2-diameter of de Bruijn graphs

0.00 Avg rating—0 Votes
Article ID: iaor2002364
Country: United States
Volume: 28
Issue: 1
Start Page Number: 7
End Page Number: 14
Publication Date: Aug 1996
Journal: Networks
Authors: , ,
Abstract:

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 UB(n) is equal to its diameter n.

Reviews

Required fields are marked *. Your email address will not be published.