Large Regular Graphs of Given Degree and Diameter

The links below point to files containing the largest known graphs for certain values of degree and diameter. Each graph is saved as an adjacency list. The vertices are labeled with the integers 0 to n-1. Line 1 lists the neighbors of vertex 0, line 2 the neighbors of vertex 1, etc.

This table lists only my constructions. For more complete information on this problem, see F. Comellas' HTML Table or C. Delorme's DVI Table.

If you see any errors, let me know.

Degree Diameter Lower Bound
36 132
37 196
38 336
39 600
310 972
311 1600
312 2916
44 98
47 1296
48 3087
53 72
54 212
55 620
63 111
64 384
73 168
76 11232
112 104
143 912
162 198

Geoff Exoo