On the coset graph construction of distance-regular graphs

DOI10.1016/j.disc.2022.113037OpenAlexW4281639754MaRDI QIDQ2166290

Denis S. Krotov, Minjia Shi, Patrick Solé

Publication date: 24 August 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.00031

zbMATH Keywords

distance-regular graphscompletely regular codes

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\)
• Distance-regular graphs
• Triple intersection numbers of \(Q\)-polynomial distance-regular graphs
• On weight distributions of perfect colorings and completely regular codes
• The nonexistence of some ternary linear codes of dimension 6
• Distance regular graphs of diameter 3 and strongly regular graphs
• Completely regular codes
• On two-weight \(\mathbb {Z}_{2^k}\)-codes
• Additive perfect codes in Doob graphs
• Strongly regular graphs from reducible cyclic codes
• Three-weight codes over rings and strongly walk regular graphs
• Two families of two-weight codes over \(\mathbb{Z}_4\)
• Three-weight codes, triple sum sets, and strongly walk regular graphs
• A new distance-regular graph of diameter 3 on 1024 vertices
• The Geometry of Two-Weight Codes Over ℤ_p^m
• A New Approach to the Kasami Codes of Type 2