On the Diameter of the Generalized De Bruijn Graphs uG<sub>B</sub>(n, n<sup>2</sup> + 1)

On the Diameter of the Generalized De Bruijn Graphs uG_B(n, n² + 1)

Dallas/Richardson, Texas, USA December 07-December 07

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ISPAN.2000.900262

2000 International Symposium on Paral ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by J. Caro Articles by L. Nochefranca Articles by P. Sy

	ASCII Text	x
	J. Caro, L. Nochefranca, P. Sy, "On the Diameter of the Generalized De Bruijn Graphs uG<sub>B</sub>(n, n<sup>2</sup> + 1)," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 57, 2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00), 2000.

	BibTex	x
	@article{ 10.1109/ISPAN.2000.900262, author = {J. Caro and L. Nochefranca and P. Sy}, title = {On the Diameter of the Generalized De Bruijn Graphs uG<sub>B</sub>(n, n<sup>2</sup> + 1)}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {2000}, issn = {1087-4089}, pages = {57}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2000.900262}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - On the Diameter of the Generalized De Bruijn Graphs uG<sub>B</sub>(n, n<sup>2</sup> + 1) SN - 1087-4089 SP EP A1 - J. Caro, A1 - L. Nochefranca, A1 - P. Sy, PY - 2000 KW - null VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

J. Caro

L. Nochefranca

P. Sy

The generalized de Bruijn graph UG_B (n, n² + 1) is the graph with vertex set V = { 0, 1, . . . , n²} and the neighbor- hood N (i) of i ? V is N(i) = X(i) n Y(i) where X(i) = {in + d(mod n² + 1) : a ? D and [(2i -MA) + (n² + l)Z] n D = ?}, Y(i) = {(p - i)n(mod n² + 1) : ? ? D and [(/?-2i)n+(n²+1)Z]flD = $}.Znthispuper,we shall show that the diameter of UG_B (n, n² + 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 uG_B(n, n² + 1)," ispan, pp.57, 2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00), 2000

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.