On distance-regular graphs of diameter 3 for which _3 is a triangle-free graph

DOI10.1515/DMA-2023-0018MaRDI QIDQ6051963zbMATH OpenFDO

Authors

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)

Recommendations

• Distance-regular graphs of diameter 3 without triangles with \(c_2=2\)
• On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)
• Distance-Regular Graphs with Intersection Arrays {7,6,6;1,1,2} and {42,30,2;1,10,36} Do not Exist
• 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
• Triangle-free distance-regular graphs

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• 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
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs

Cited in

(3)

• Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3
• 3-bounded property in a triangle-free distance-regular graph
• There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6051963)