A Structured Table of Graphs with Symmetries and Other Special Properties
classification
💻 cs.DM
math.CO
keywords
graphsminimalsymmetriestableapplicationsbisectiondegreesdesign
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.