On the coset graph construction of distance-regular graphs
arXiv:2206.00031 · doi:10.1016/j.disc.2022.113037
Abstract
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.