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. © 1996 John Wiley & Sons, Inc.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
