Small diameter symmetric networks from linear groups
L. Campbell, Gunnar Carlsson, Michael J. Dinneen, Vance Faber, Michael R. Fellows, Micheal A. Langston, James W. Moore, Andrew P. Mullhaupt, Harlan Sexton · IEEE Transactions on Computers · 1992
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.>