Automorphisms of a distance-regular graph with intersection array \(\{176, 135, 32, 1; 1, 16, 135, 176\}\)

DOI10.1134/S0081543819040114zbMath1430.05138MaRDI QIDQ2284203

Aleksandr Alekseevich Makhnev, Dmitriĭ Viktorovich Paduchikh

Publication date: 14 January 2020

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

zbMATH Keywords

distance-regular graphstrongly regular graphgraph automorphism

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) General theory for finite permutation groups (20B05)

Uses Software

• GAP

Cites Work

• Unnamed Item
• On strongly regular graphs with eigenvalue \(\mu\) and their extensions
• Graphs in which the neighborhoods of vertices are pseudogeometric graphs for \(GQ(3,3)\)
• On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)
• Strongly regular graphs with non-trivial automorphisms
• The Gewirtz graph: An exercise in the theory of graph spectra
• Finite simple groups with narrow prime spectrum.

This page was built for publication: Automorphisms of a distance-regular graph with intersection array \(\{176, 135, 32, 1; 1, 16, 135, 176\}\)