A Structured Table of Graphs with Symmetries and Other Special Properties

10/29/2019
by   Yidan Zhang, et al.
0

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.

READ FULL TEXT

page 5

page 6

page 7

research
10/29/2019

A Structured Table of Graphs with Special Properties

We organize a table of regular graphs with minimal diameters and mean pa...
research
04/01/2019

Optimal Low-Latency Network Topologies for Cluster Performance Enhancement

We propose that clusters interconnected with network topologies having m...
research
01/04/2022

Optimal circulant graphs as low-latency network topologies

Communication latency has become one of the determining factors for the ...
research
03/09/2022

Minimal obstructions for polarity, monopolarity, unipolarity and (s,1)-polarity in generalizations of cographs

Every hereditary property can be characterized by finitely many minimal ...
research
03/18/2022

A Cost-Efficient Look-Up Table Based Binary Coded Decimal Adder Design

The BCD (Binary Coded Decimal) being the more accurate and human-readabl...
research
09/25/2019

Ramanujan Graphs and the Spectral Gap of Supercomputing Topologies

Graph eigenvalues play a fundamental role in controlling structural prop...
research
05/31/2020

Filling in pattern designs for incomplete pairwise comparison matrices: (quasi-)regular graphs with minimal diameter

Multicriteria Decision Making problems are important both for individual...

Please sign up or login with your details

Forgot password? Click here to reset