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

DOI10.33048/semi.2019.16.087zbMath1425.05072OpenAlexW3016058369MaRDI QIDQ2331137

M. M. Isakova, Aleksandr Alekseevich Makhnev, Marina Sefovna Nirova

Publication date: 25 October 2019

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2019.16.087

zbMATH Keywords

distance-regular graphtriple intersection numbers

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12)

Related Items

On distance-regular graphs \(\Gamma\) of diameter 3 for which \(\Gamma_3\) is a triangle-free graph ⋮ The nonexistence small \(Q\)-polynomial graphs of type (III) ⋮ Inverse problems of graph theory: graphs without triangles ⋮ On \(Q\)-polynomial distance-regular graphs \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)

Cites Work

• Unnamed Item
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
• On automorphisms of a distance-regular graph with intersection array \(\{119,100,15;1,20,105\}\)
• On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)
• The Sylvester graph and Moore graphs
• On automorphisms of a distance-regular graph with intersection array $\{69, 56, 10; 1, 14, 60\}$