Automorphisms of distance-regular graph with intersection array \(\{144,125,32,1;1,8,125,144\}\)

DOI10.17377/semi.2017.14.018zbMath1357.05059MaRDI QIDQ515214

Marina Sefovna Nirova

Publication date: 13 March 2017

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

automorphismdistance-regular graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On strongly regular graphs with eigenvalue \(\mu\) and their extensions
• \(\Phi\)-harmonic functions on discrete groups and the first \(\ell^\Phi\)-cohomology
• On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)
• Strongly regular graphs with non-trivial automorphisms
• Rough isometries and the parabolicity of Riemannian manifolds
• The Gewirtz graph: An exercise in the theory of graph spectra
• \(p\)-harmonic functions on graphs and manifolds
• Finite simple groups with narrow prime spectrum.
• A new proof of Gromov’s theorem on groups of polynomial growth
• Mathematical analysis II. Transl. from the 4th Russian edition by Roger Cooke

This page was built for publication: Automorphisms of distance-regular graph with intersection array \(\{144,125,32,1;1,8,125,144\}\)