On automorphisms of a distance-regular graph with intersection array \(\{99, 84, 30; 1, 6, 54\}\)

DOI10.1515/DMA-2018-0003zbMath1385.05031OpenAlexW2792250337MaRDI QIDQ1744346

Konstantin S. Efimov, Aleksandr Alekseevich Makhnev

Publication date: 23 April 2018

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2018-0003

zbMATH Keywords

distance-regular graphstrongly regular graphautomorphism of a graph

Mathematics Subject Classification ID

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

Related Items (1)

On automorphisms of a distance-regular graph with intersection array \(\{96,76,1;1,19,96\}\)

Cites Work

• Unnamed Item
• Unnamed Item
• On graphs whose local subgraphs are strongly regular with parameters \((99, 14, 1, 2)\)
• On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)
• Automorphisms of a graph with intersection array \(\{99, 84, 1; 1, 14, 99\}\)
• On automorphisms of strongly regular graphs with parameters λ = 1, μ = 2

This page was built for publication: On automorphisms of a distance-regular graph with intersection array \(\{99, 84, 30; 1, 6, 54\}\)