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

DOI10.1134/S1064562411040272zbMath1235.05066MaRDI QIDQ656389

Aleksandr Alekseevich Makhnev, Natal'ya Dmitrievna Zyulyarkina

Publication date: 17 January 2012

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

zbMATH Keywords

distance-regular graphsedge-symmetric graphs

Mathematics Subject Classification ID

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

Distance-regular graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{60,45,8;1,12,50\}\) do not exist, Automorphisms of distance regular graph with intersection array \(\{30,27,24;1,2,10\}\), Automorphisms of distance-regular graph with intersection array \(\{24,18,9;1,1,16\}\)

Cites Work

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