Abstract
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.
Original language | English (US) |
---|---|
Article number | 2 |
Journal | Symmetry |
Volume | 12 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1 2020 |
Keywords
- Discrete optimization
- Graph theory
- Interconnection network
- Symmetry
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- Chemistry (miscellaneous)
- General Mathematics
- Physics and Astronomy (miscellaneous)