How to use this site

The graphs on DistanceRegular.org are available for download in various formats: adjacency matrices are given in plain text (suitable for programmers), CSV format (suitable for use in MATLAB) and in list form (suitable for software such as GAP); graphs are also available as files to be read by the GAP package GRAPE. Other formats may become available in future. Some of the GAP files were obtained using the GAP packages DESIGN and FinInG.

To browse the site, graphs are indexed in various ways: by graph family, by size, by valency, by diameter, and through an A-to-Z list.

Some background material on distance-regular graphs can be found here. For more detailed information on distance-regular graphs in general, and the graphs on this site, the following references are invaluable:

A. E. Brouwer, A. M. Cohen and A. Neumaier, Distance-Regular graphs, Springer-Verlag, 1989; ISBN 0-387-50619-5.
C. E. Praeger and L. H. Soicher, Low Rank Representations and Graphs for Sporadic Groups, Cambridge University Press, 1997; ISBN 0-521-56737-8.
E. R. van Dam, J. H. Koolen and H. Tanaka, Distance-Regular Graphs, Electronic Journal of Combinatorics, Dynamic Survey #DS22, 2016; arXiv:1410.6294.

Can't find the graph you want? Contact us with your request.

Last updated: 22 February 2017