  We organize a table of regular graphs with minimal diameters and minimal mean
path lengths, large bisection widths and high degrees of symmetries, obtained
by enumerations on supercomputers. These optimal graphs, many of which are
newly discovered, may find wide applications, for example, in design of network
topologies.

Discrete Mathematics;Combinatorics