On automorphisms of distance-regular graphs with intersection arrays \(\{2r + 1, 2r 2, 1; 1, 2, 2r + 1\}\)

DOI10.1134/S0081543817020080zbMath1475.05079OpenAlexW3004346281MaRDI QIDQ2362419

Ivan Nikolaevich Belousov, Aleksandr Alekseevich Makhnev

Publication date: 7 July 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/s0081543817020080

zbMATH Keywords

distance-regular graphgraph automorphism

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Simple groups: alternating groups and groups of Lie type (20D06) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Quantum breathers in a two-dimensional hexangular Heisenberg ferromagnet

Cites Work

• On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)
• An automorphism group of a distance-regular graph with intersection array \(\{24, 21, 3; 1, 3, 18\}\)
• Finite simple groups with narrow prime spectrum.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On automorphisms of distance-regular graphs with intersection arrays \(\{2r + 1, 2r 2, 1; 1, 2, 2r + 1\}\)