Automorphisms of a graph with intersection array \(\{nm - 1, nm - n + m - 1, n - m + 1;1, 1, nm - n + m - 1\}\)

DOI10.1007/S10469-020-09611-XOpenAlexW3108445277MaRDI QIDQ828118

Aleksandr Alekseevich Makhnev, Mikhaĭl Petrovich Golubyatnikov

Publication date: 8 January 2021

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-020-09611-x

zbMATH Keywords

strongly regular graphsdistance-regular graphsgraph automorphisms

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (1)

On small distance-regular graphs with the intersection arrays \( \{mn - 1, (m - 1)(n + 1), n - m + 1; 1, 1, (m - 1)(n + 1)\}\)

Cites Work

• Unnamed Item
• On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)
• Distance-regular Shilla graphs with \(b_2 = c_2\)
• Inverse problems in graph theory: nets
• A generalization of Moore graphs of diameter two
• AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}

This page was built for publication: Automorphisms of a graph with intersection array \(\{nm - 1, nm - n + m - 1, n - m + 1;1, 1, nm - n + m - 1\}\)