Tables of Parameters for Distance Regular Graphs

Abstract

This chapter contains tables of parameters for primitive distance-regular graphs with diameter 3 on at most 1024 vertices, for non-bipartite distance-regular graphs with diameter 4 on at most 4096 vertices, and for arbitrary distance-regular graphs of diameter at least 5 on at most 4096 vertices. In each category the parameter sets are ordered by k (not v). We only list intersection arrays that pass all feasibility criteria known to us. We do not give any information on the polygons (e.g., these have many P- and Q-polynomial structures).