On automorphisms of a distance-regular graph with intersection array $\{69, 56, 10; 1, 14, 60\}$

DOI10.1134/S0081543818090171zbMath1414.05315OpenAlexW2922382813MaRDI QIDQ2424190

Yanyan Li

Publication date: 24 June 2019

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

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

zbMATH Keywords

distance-regular graphautomorphism of a graph

Mathematics Subject Classification ID

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

Related Items (2)

The prime spectrum of an automorphism group of an 𝐴𝑇4(𝑝,𝑝+2,𝑟)-graph ⋮ Distance-regular graphs with intersection array \(\{69,56,10;1,14,60\}\), \(\{74,54,15;1,9,60\}\) and \(\{119,100,15;1,20,105\}\) do not exist

Cites Work

• Unnamed Item
• Unnamed Item
• Automorphisms of a strongly regular graph with parameters \((276, 75, 10, 24)\)
• On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)
• Strongly regular graphs with non-trivial automorphisms
• Automorphisms of a graph with intersection array \(\{115,96,30,1;1,10,96,115\}\)
• Automorphisms of a strongly regular graph with parameters (392, 115, 18, 40)
• Finite simple groups with narrow prime spectrum.

This page was built for publication: On automorphisms of a distance-regular graph with intersection array $\{69, 56, 10; 1, 14, 60\}$