Automorphisms of graph with intersection array \(\{289,216,1;1,72,289\}\)

zbMath1394.05048MaRDI QIDQ1669916

Aleksandr Alekseevich Makhnev, Mikhaĭl Petrovich Golubyatnikov

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Distance regular covers of the complete graph
• On graphs in which neighborhoods of vertices are strongly regular with parameters \((85,14,3,2)\) or \((325,54,3,10)\)
• 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\}\)