On the coset graph construction of distance-regular graphs

On the coset graph construction of distance-regular graphs Full article

Journal

Discrete Mathematics
ISSN: 0012-365X , E-ISSN: 1872-681X

Output data

Year: 2022, Volume: 345, Number: 11, Article number : 113037, Pages count : 6 DOI: 10.1016/j.disc.2022.113037

Tags

Completely regular codes, Distance-regular graphs

Authors

Shi M.J. ¹ , Krotov Denis Stanislavovich ² , Solé P. ³

Affiliations

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
3	I2M (CNRS, Centrale Marseille, University of Aix-Marseille), Marseilles, France

Funding (1)

Sobolev Institute of Mathematics

FWNF-2022-0017

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.

Shi M.J. , Krotov D.S. , Solé P.
On the coset graph construction of distance-regular graphs
Discrete Mathematics. 2022. V.345. N11. 113037 :1-6. DOI: 10.1016/j.disc.2022.113037 WOS Scopus РИНЦ OpenAlex

Submitted:	Jan 28, 2022
Accepted:	Jun 1, 2022

Web of science:	WOS:000812166400006
Scopus:	2-s2.0-85131763891
Elibrary:	49156686
OpenAlex:	W4281639754

DB	Citing
Scopus	2
Web of science	1
Elibrary	1
OpenAlex	1