Distance-regular graphs of diameter 3 without triangles with \(c_2=2\)

DOI10.1007/S40304-021-00281-4zbMath1506.05223OpenAlexW4299458423MaRDI QIDQ2100140

Wen-Bin Guo, Konstantin S. Efimov, Aleksandr Alekseevich Makhnev

Publication date: 21 November 2022

Published in: Communications in Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40304-021-00281-4

zbMATH Keywords

distance regular graphtriple intersection numbersgraph without triangles

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
• There exists no distance-regular graph with intersection array \((5,4,3;1,1,2)\)
• Distance-regular Shilla graphs with \(b_2 = c_2\)
• Inverse problems in graph theory: nets

This page was built for publication: Distance-regular graphs of diameter 3 without triangles with \(c_2=2\)