On distance-regular graphs \(\Gamma\) of diameter 3 for which \(\Gamma_3\) is a triangle-free graph

DOI10.1515/DMA-2023-0018zbMath1527.05179MaRDI QIDQ6051963

No author found.

Publication date: 20 September 2023

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

zbMATH Keywords

distance-regular graphtriangle-free graphtriple intersection numbers

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
• A characterization of the graphs of bilinear \((d\times d)\)-forms over \(\mathbb{F}_2\)
• Distance-regular graphs with intersection array \(\{69,56,10;1,14,60\}\), \(\{74,54,15;1,9,60\}\) and \(\{119,100,15;1,20,105\}\) do not exist
• Distance-regular graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{60,45,8;1,12,50\}\) do not exist

This page was built for publication: On distance-regular graphs \(\Gamma\) of diameter 3 for which \(\Gamma_3\) is a triangle-free graph