loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00)
On the Diameter of the Generalized De Bruijn Graphs uGB(n, n2 + 1)
Dallas/Richardson, Texas, USA
December 07-December 07
ISBN: 0-7695-0936-3
The generalized de Bruijn graph UGB (n, n2 + 1) is the graph with vertex set V = { 0, 1, . . . , n2} and the neighbor- hood N (i) of i ? V is N(i) = X(i) n Y(i) where X(i) = {in + d(mod n2 + 1) : a ? D and [(2i -MA) + (n2 + l)Z] n D = ?}, Y(i) = {(p - i)n(mod n2 + 1) : ? ? D and [(/?-2i)n+(n2+1)Z]flD = $}.Znthispuper,we shall show that the diameter of UGB (n, n2 + 1) is at most 4for n odd and n l\geq 5
Citation:
J. Caro, L. Nochefranca, P. Sy, "On the Diameter of the Generalized De Bruijn Graphs uGB(n, n2 + 1)," ispan, pp.57, 2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00), 2000
Usage of this product signifies your acceptance of the Terms of Use.