On the coset graph construction of distance-regular graphs

DOI10.1016/J.DISC.2022.113037MaRDI QIDQ6400725arXivFDO

Authors Minjia Shi, Denis S. Krotov, Patrick Solé

Publication date 31 May 2022

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.DISC.2022.113037

Mathematics Subject Classification ID

Distance in graphs (05C12) Association schemes, strongly regular graphs (05E30) Cyclic codes (94B15)

arXiv classification

cs.DMmath.CO

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.

This page was built for publication: On the coset graph construction of distance-regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6400725)