On automorphisms of distance-regular graph with intersection array \(\{15, 12, 1; 1, 2, 15\}\)

DOI10.1134/S1064562412040230zbMath1293.05222MaRDI QIDQ1761067

Aleksandr Alekseevich Makhnev, Vladimir P. Burichenko

Publication date: 15 November 2012

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

Higman's method

Mathematics Subject Classification ID

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

Related Items (5)

On automorphisms of a distance-regular graph with intersection array \(\{39, 36, 1; 1, 2, 39\}\) ⋮ Edge-symmetric distance-regular covers of cliques with \(\lambda=\mu\) ⋮ On automorphisms of a distance-regular graph with intersection array \(\{51, 48, 8; 1, 4, 36\}\) ⋮ Automorphism groups of small distance-regular graphs ⋮ Arc-transitive distance-regular covers of cliques with \(\lambda = \mu\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On automorphisms of a distance-regular graph with intersection array \(\{81, 60, 1; 1, 20, 81\}\)
• On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)

This page was built for publication: On automorphisms of distance-regular graph with intersection array \(\{15, 12, 1; 1, 2, 15\}\)