On automorphisms of a distance-regular graph with intersection array \(\{39, 36, 1; 1, 2, 39\}\)

DOI10.1134/S0081543816090042zbMath1364.05025OpenAlexW2922378401MaRDI QIDQ2396368

Ivan Nikolaevich Belousov

Publication date: 8 June 2017

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543816090042

zbMATH Keywords

distance-regular graphgraph automorphism

Mathematics Subject Classification ID

Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• On automorphisms of a distance-regular graph with intersection array \(\{24, 21, 3; 1, 3, 18\}\)
• On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)
• On automorphisms of a distance-regular graph with intersection array \({\{35,32,1;1,2,35\}}\)
• Antipodal distance transitive covers of complete graphs
• On automorphisms of distance-regular graph with intersection array \(\{15, 12, 1; 1, 2, 15\}\)
• Finite simple groups with narrow prime spectrum.

This page was built for publication: On automorphisms of a distance-regular graph with intersection array \(\{39, 36, 1; 1, 2, 39\}\)