Publication Date:
2019-08-28
Description:
In this note is reported 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:
CYBERNETICS
Type:
IEEE Transactions on Computers (ISSN 0018-9340); 41; 218-220
Format:
text
Permalink