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 n1. 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.



Geoff Exoo