Inverse problems in the class of distance-regular graphs of diameter 4

DOI10.1134/S0081543822030105zbMath1504.05305MaRDI QIDQ2095491

Dmitriĭ Viktorovich Paduchikh, Aleksandr Alekseevich Makhnev

Publication date: 17 November 2022

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

zbMATH Keywords

distance-regular graphantipodal graphgraph \(\Gamma\) with strongly regular graph \(\Gamma \mathrm{i} ,\mathrm{j} \)

Mathematics Subject Classification ID

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

Uses Software

• FinInG
• sage-drg

Cites Work

• Unnamed Item
• On strongly regular graphs with eigenvalue \(\mu\) and their extensions
• Tight distance-regular graphs
• Distance-regular Shilla graphs with \(b_2 = c_2\)
• Using symbolic computation to prove nonexistence of distance-regular graphs
• Automorphisms of an \(AT4(4, 4, 2)\)-graph and of the corresponding strongly regular graphs
• The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results
• The graph \(\operatorname{Kre}(4)\) does not exist
• Classification of the family AT4(\(qs,q,q\)) of antipodal tight graphs
• On Krein graphs without triangles

This page was built for publication: Inverse problems in the class of distance-regular graphs of diameter 4