DocumentCode
1631562
Title
On the diameter of a class of the generalized de Bruijn graphs
Author
Caro, Jaime D L ; Zeratsion, Tedros Weldemicael
Author_Institution
Dept. of Comput. Sci., Univ. of the Philippines Diliman, Quezon City, Philippines
fYear
2002
fDate
6/24/1905 12:00:00 AM
Firstpage
197
Lastpage
202
Abstract
The generalized de Bruijn digraph denoted by GB(n, m) is defined to be the digraph with m vertices labelled by 0, 1, 2, ..., m-1 and with the adjacency defined as follows: If i is a vertex in GB(n, m) then i is connected to each vertex in the set E(i), where E(i)={ni+α(mod m)|α∈[0, n-1]}. The generalized de Bruijn graph denoted by UGB(n, m) is defined to be the undirected version of GB(n, m) obtained by replacing each arc by an undirected edge and eliminating self-loops and multi-edges. In this paper we show that the diameter of UGB(n, m) is 2 for any m in [n+1, n2] where n divides m and that the diameter is 3 for any m in [n2+1, n3] where n divides m
Keywords
directed graphs; hypercube networks; digraph; generalized de Bruijn graphs; undirected edge; vertex; Cities and towns; Computer science; Hypercubes; Multiprocessor interconnection networks; Welding;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Architectures, Algorithms and Networks, 2002. I-SPAN '02. Proceedings. International Symposium on
Conference_Location
Makati City, Metro Manila
ISSN
1087-4089
Print_ISBN
0-7695-1579-7
Type
conf
DOI
10.1109/ISPAN.2002.1004286
Filename
1004286
Link To Document