Automorphisms of distance regular graph with intersection array \(\{30,27,24;1,2,10\}\)
DOI10.33048/semi.2019.16.031zbMath1410.05228OpenAlexW3002438369MaRDI QIDQ2633612
Veronika Igorevna Belousova, Aleksandr Alekseevich Makhnev
Publication date: 9 May 2019
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33048/semi.2019.16.031
Association schemes, strongly regular graphs (05E30) 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)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On automorphisms of a distance-regular graph with intersection array \(\{51, 48, 8; 1, 4, 36\}\)
- On automorphisms of distance-regular graph with intersection array \(\{15, 12, 6; 1, 2, 10\}\)
- On automorphisms of distance-regular graph with intersection array \(\{18,15,9;\,1,1,10\}\)
- The Gewirtz graph: An exercise in the theory of graph spectra
- An automorphism group of a distance-regular graph with intersection array \(\{24, 21, 3; 1, 3, 18\}\)
- On automorphisms of a distance-regular graph with intersection array \(\{33,30,15;1,2,15\}\)
- On geometric distance-regular graphs with diameter three
- Finite simple groups with narrow prime spectrum.
- AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}
This page was built for publication: Automorphisms of distance regular graph with intersection array \(\{30,27,24;1,2,10\}\)