On automorphisms of a distance-regular graph with intersection array \(\{35,32,1;1,4,35\}\)

DOI10.1134/S0081543815050193zbMath1319.05090OpenAlexW2765838837MaRDI QIDQ492293

Ludmila Yur'evna Tsiovkina

Publication date: 20 August 2015

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

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

zbMATH Keywords

automorphismdistance-regular grapharc-transitive graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Automorphism group of a distance-regular graph with intersection array \(\{35,32,1;1,4,35\}\)

Cites Work

• On automorphisms of a distance-regular graph with intersection array \(\{42, 39, 1; 1, 3, 42\}\)
• On automorphisms of a distance-regular graph with intersection array \({\{35,32,1;1,2,35\}}\)
• On automorphisms of a distance-regular graph with intersection array \(\{27,24,1;1,8,27\}\)
• Edge-symmetric distance-regular coverings of cliques: the affine case
• Unnamed Item

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