We organize a table of regular graphswithminimal diameters andminimalmean 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 optimization
- Graph theory
- Interconnection network
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- Chemistry (miscellaneous)
- Physics and Astronomy (miscellaneous)