On automorphisms of a distance-regular graph with intersection array \(\{119,100,15;1,20,105\}\)

zbMath1394.05046MaRDI QIDQ1669896

Aleksandr Alekseevich Makhnev, Maryana Malilovna Isakova

Publication date: 4 September 2018

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

zbMATH Keywords

automorphismdistance-regular graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

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

Cites Work

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

This page was built for publication: On automorphisms of a distance-regular graph with intersection array \(\{119,100,15;1,20,105\}\)