On the coset graph construction of distance-regular graphs |
| |
| Affiliation: | 1. Key Laboratory of Intelligent Computing and Signal Processing, Ministry of Education, School of Mathematical Sciences, Anhui University, Hefei, 230601, China;2. Sobolev Institute of Mathematics, Novosibirsk 630090, Russia;3. I2M (CNRS, Centrale Marseille, University of Aix-Marseille), Marseilles, France |
| |
| 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. |
| |
| Keywords: | Completely regular codes Distance-regular graphs |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
