Advertisement

Tables of Parameters for Distance Regular Graphs

  • Andries E. Brouwer
  • Arjeh M. Cohen
  • Arnold Neumaier
Part of the Ergebnisse der Mathematik und ihrer Grenzgebiete book series (MATHE3, volume 18)

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 intersectiòn 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).

Keywords

Intersection Array Incidence Graph Distance Regular Graph Golay Code Johnson Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Andries E. Brouwer
    • 1
  • Arjeh M. Cohen
    • 1
  • Arnold Neumaier
    • 2
  1. 1.Centrum voor Wiskunde en InformaticaStichting Mathematisch CentrumAmsterdamThe Netherlands
  2. 2.Institut für Angewandte MathematikUniversität FreiburgFreiburg im BreisgauGermany

Personalised recommendations