AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {25; 16; 1; 1; 8; 25}

DOI10.15826/UMJ.2017.1.001zbMath1448.05231OpenAlexW2735369179MaRDI QIDQ5125181

Aleksandr Alekseevich Makhnev, Konstantin S. Efimov

Publication date: 5 October 2020

Published in: Ural mathematical journal (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/umj29

zbMATH Keywords

distance-regular graphstrongly regular graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Edge-symmetric distance-regular covers of cliques with \(\lambda=\mu\)
• On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)
• Distance regular graphs in which local subgraphs are strongly regular graphs with the second eigenvalue at most 3
• On graphs in which neighborhoods of vertices are strongly regular with parameters \((85,14,3,2)\) or \((325,54,3,10)\)
• Automorphisms of a graph with intersection array \(\{99, 84, 1; 1, 14, 99\}\)
• Automorphisms of graph with intersection array \(\{64,42,1;1,21,64\}\)
• Finite simple groups with narrow prime spectrum.

This page was built for publication: AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {25; 16; 1; 1; 8; 25}