A collection of maximal d-regular graphs for a given diameter D.

Here, "maximal" means attaining the upper bound for the algebraic
connectivity for given d,D. Refer to paper pdf in this directory.

Folder "g6" contains the list of graphs in the g6 format.  For
example the file "3-7-44.g6" contains cubic graphs (d=3) of
diameter 7 (on 44 vertices) attaing the upper bound of AC=0.6571.
There are 45 such graphs in total.

Folder "txt" contains the same list in basic text format. It
lists graphs one per line. For example a line "1 2 2 3 3 1" means
a graph whose vertices are 1,2,3 and whose edges are (1,2),
(2,3), and (3,1).

Folder "code" contains C code that uses hill-climbing stochastic
algorithm to search for the maximal graphs. See paper/code for
details.