DocumentCode :
795070
Title :
Small diameter symmetric networks from linear groups
Author :
Campbell, L. ; Carlsson ; Dinneen, Michael J. ; Fellows, M.R. ; Langston, M.A. ; Moore, J.W. ; Sexton
Author_Institution :
Dept. of Electr. Eng., Idaho Univ., Moscow, ID
Volume :
41
Issue :
2
fYear :
1992
fDate :
2/1/1992 12:00:00 AM
Firstpage :
218
Lastpage :
220
Abstract :
A report is presented on a collection of constructions of symmetric networks that provide the largest known values for the number of nodes that can be placed in a network of a given degree and diameter. Some of the constructions are in the range of current potential engineering significance. The constructions are Cayley graphs of linear groups obtained by experimental computation
Keywords :
graph theory; group theory; multiprocessor interconnection networks; Cayley graphs; linear groups; nodes; symmetric networks; Computer science; Concurrent computing; Cryptographic protocols; Laboratories; Local area networks; Mathematics; Multiprocessor interconnection networks; Organizing; Parallel processing; Routing;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.123397
Filename :
123397
Link To Document :
بازگشت