Automorphisms of graphs with intersection arrays \(\{60, 45, 8; 1, 12, 50\}\) and \(\{49, 36, 8; 1, 6, 42\}\)

DOI10.1134/S0001434617050200zbMath1369.05054MaRDI QIDQ2401659

Alexander L. Gavrilyuk, Aleksandr Alekseevich Makhnev

Publication date: 4 September 2017

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

distance regular graphvertex symmetric graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph designs and isomorphic decomposition (05C51)

Related Items (1)

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

Cites Work

• On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)
• Finite simple groups with narrow prime spectrum.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automorphisms of graphs with intersection arrays \(\{60, 45, 8; 1, 12, 50\}\) and \(\{49, 36, 8; 1, 6, 42\}\)