Inverse problems in the theory of distance-regular graphs

DOI10.1134/S0081543819070071zbMath1441.05247OpenAlexW2890348677MaRDI QIDQ2185643

Dmitriĭ Viktorovich Paduchikh, Aleksandr Alekseevich Makhnev

Publication date: 5 June 2020

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

Full work available at URL: https://doi.org/10.1134/s0081543819070071

zbMATH Keywords

distance-regular graphstrongly regular graphintersection array

Mathematics Subject Classification ID

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

Related Items (2)

ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\) ⋮ Inverse problems of graph theory: graphs without triangles

Cites Work

• Triple intersection numbers of \(Q\)-polynomial distance-regular graphs
• A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph
• Distance-regular graphs with intersection arrays \(\{52, 35, 16; 1, 4, 28\}\) and \(\{69, 48, 24; 1, 4, 46\}\) do not exist
• Extremal 1-codes in distance-regular graphs of diameter 3
• Shilla distance-regular graphs
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
• Distance-regular Shilla graphs with \(b_2 = c_2\)
• On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)
• Correction to: ``A new distance-regular graph of diameter 3 on 1024 vertices
• Distance-regular graph with the intersection array {45, 30, 7; 1, 2, 27} does not exist
• Unnamed Item

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