On the coset graph construction of distance-regular graphs *

Minjia Shi (1) , Denis Krotov (2) , Patrick Solé (3)

1 Anhui University [Hefei]
2 Sobolev Institute of Mathematics
3 I2M - Institut de Mathématiques de Marseille

We show that no more new distance-regular graphs in the tables of the book of (Brouwer, Cohen, Neumaier, 1989) can be produced by using the coset graph of additive completely regular codes over finite fields.

Mots clés: distance-regular graphs; completely regular codes

Domaines: Combinatoire [math.CO]; Théorie de l'information [cs.IT]

Minjia Shi, Denis Krotov, Patrick Solé. On the coset graph construction of distance-regular graphs *. Discrete Mathematics, 2022. ⟨hal-03684611⟩