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

DOI10.1134/S1064562411040272MaRDI QIDQ656389zbMATH OpenFDO

Authors Natal'ya Dmitrievna Zyulyarkina, Alexandre A. Makhnev

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

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 1261512 (Why is no real title available?)
• On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)

Cited in

(3)

• 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 \(\{24,18,9;1,1,16\}\)
• Automorphisms of distance regular graph with intersection array \(\{30,27,24;1,2,10\}\)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656389)