Distance-regular graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{60,45,8;1,12,50\}\) do not exist

DOI10.33048/SEMI.2018.15.125zbMath1411.05071OpenAlexW3015558647MaRDI QIDQ2633389

Ivan Nikolaevich Belousov, Aleksandr Alekseevich Makhnev

Publication date: 8 May 2019

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

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

zbMATH Keywords

distance-regular graphtriple intersection numbersShilla graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (4)

Distance-regular graph with intersection array \(\{105,72,24;1,12,70\}\) does not exist ⋮ On distance-regular graphs \(\Gamma\) of diameter 3 for which \(\Gamma_3\) is a triangle-free graph ⋮ Automorphisms of a distance-regular graph with intersection array \(\{30,22,9;1,3,20\}\) ⋮ Automorphisms of distance-regular graph with intersection array \(\{24,18,9;1,1,16\}\)

Cites Work

• Unnamed Item
• Extremal 1-codes in distance-regular graphs of diameter 3
• On automorphisms of distance-regular graph with intersection array \(\{15, 12, 6; 1, 2, 10\}\)
• Shilla distance-regular graphs
• Automorphisms of graphs with intersection arrays \(\{60, 45, 8; 1, 12, 50\}\) and \(\{49, 36, 8; 1, 6, 42\}\)

This page was built for publication: Distance-regular graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{60,45,8;1,12,50\}\) do not exist