A Structured Table of Graphs with Symmetries and Other Special Properties
arXiv:1910.13539 · doi:10.3390/sym12010002
Abstract
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.
add details about automorphism group