Issue No. 02 - February (1992 vol. 41)

ISSN: 0018-9340

pp: 218-220

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.123397

ABSTRACT

<p>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.</p>

INDEX TERMS

linear groups; symmetric networks; nodes; Cayley graphs; graph theory; group theory; multiprocessor interconnection networks.

CITATION

L. Campbell, G.E. Carlsson, M.J. Dinneen, V. Faber, M.R. Fellows, M.A. Langston, J.W. Moore, A.P. Mullhaupt, H.B. Sexton, "Small Diameter Symmetric Networks From Linear Groups",

*IEEE Transactions on Computers*, vol. 41, no. , pp. 218-220, February 1992, doi:10.1109/12.123397CITATIONS

SEARCH