DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {27, 20, 7; 1, 4, 21} DOES NOT EXIST

DOI10.15826/UMJ.2020.2.006zbMath1462.05119OpenAlexW3116250533MaRDI QIDQ4986291

Aleksandr Alekseevich Makhnev, Konstantin S. Efimov

Publication date: 27 April 2021

Published in: Ural Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

automorphismdistance-regular graphgraph \(\Gamma \)with strongly regular graph \(\Gamma_3\)

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Extremal 1-codes in distance-regular graphs of diameter 3
• On automorphisms of distance-regular graph with intersection array \(\{18,15,9;\,1,1,10\}\)
• Distance-regular Shilla graphs with \(b_2 = c_2\)
• An automorphism group of a distance-regular graph with intersection array \(\{24, 21, 3; 1, 3, 18\}\)

This page was built for publication: DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {27, 20, 7; 1, 4, 21} DOES NOT EXIST