Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3 (Q2462330)

The graphs of the type mentioned in the title are studied. First, the authors show that the eigenvalue \(\theta\) with the multiplicity equal to the valency satisfies \(\theta=-1\) if and only if the graph is antipodal. Then, the authors consider the primitive (i.e. non-antipodal) case. The only known example of such a graph is the coset graph of the doubly truncated binary Golay code. A number of properties of such graphs, such as formal self-duality, is established, and possible intersection arrays for the valency up to 4000 are studied. Under a natural extra condition on sizes of certain subgraphs the uniqueness of the only known example is shown.