On automorphisms of a distance-regular graph with intersection array \(\{99, 84, 1; 1, 12, 99\}\)

DOI10.1134/S0081543817050030zbMath1373.05046OpenAlexW2802537234MaRDI QIDQ1675310

Ivan Nikolaevich Belousov

Publication date: 27 October 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/s0081543817050030

zbMATH Keywords

distance-regular graphautomorphism of a graph

Mathematics Subject Classification ID

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

Related Items (1)

On automorphisms of a distance-regular graph with intersection array \(\{96,76,1;1,19,96\}\)

Cites Work

• Unnamed Item
• On graphs whose local subgraphs are strongly regular with parameters \((99, 14, 1, 2)\)
• On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)
• Finite simple groups with narrow prime spectrum.
• On automorphisms of strongly regular graphs with parameters λ = 1, μ = 2

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