Automorphisms of graph with intersection array \(\{232,198,1;1,33,232\}\)

zbMath1394.05049MaRDI QIDQ1669918

Madina Mukhadinovna Khamgokova, Aleksandr Alekseevich Makhnev

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Distance regular covers of the complete graph
• Automorphisms of graph with intersection array \(\{289,216,1;1,72,289\}\)
• On automorphisms of a distance-regular graph with intersection array \(\{243,220,1;1,22,243\}\)
• Finite simple groups with narrow prime spectrum.
• Automorphisms of a graph with intersection array \(\{169,126,1;1,42,169\}\)

This page was built for publication: Automorphisms of graph with intersection array \(\{232,198,1;1,33,232\}\)