Issue No. 02 - February (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.123397
<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>
linear groups; symmetric networks; nodes; Cayley graphs; graph theory; group theory; multiprocessor interconnection networks.
M. Langston et al., "Small Diameter Symmetric Networks From Linear Groups," in IEEE Transactions on Computers, vol. 41, no. , pp. 218-220, 1992.