DocumentCode
2370296
Title
Undirected circulant graphs
Author
Muga, Felix P., II
Author_Institution
Dept. of Math., Ateneo de Manila Univ., Philippines
fYear
1994
fDate
14-16 Dec 1994
Firstpage
113
Lastpage
118
Abstract
A fundamental problem in designing massively parallel computer systems and fast communication networks is the maximization of the number of nodes given a diameter and degree of a network. This maximal number is bounded above by the Moore bound. For undirected circulant graphs, an upper bound is also given but no exact formula has been found yet for degree ⩾6. A refinement on this upper bound is given in this paper. It is determined also that this maximal number is odd
Keywords
communication complexity; multiprocessor interconnection networks; circulant graphs; fast communication networks; massively parallel computer systems; maximization; number of nodes; undirected circulant graphs; upper bound; Communication networks; Computer networks; Concurrent computing; Electronic mail; Mathematics; Parallel architectures; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Architectures, Algorithms and Networks, 1994. (ISPAN), International Symposium on
Conference_Location
Kanazawa
Print_ISBN
0-8186-6507-6
Type
conf
DOI
10.1109/ISPAN.1994.367157
Filename
367157
Link To Document