On automorphisms of a distance-regular graph with intersection array \(\{51, 48, 8; 1, 4, 36\}\)

DOI10.1134/S1064562413030022zbMath1297.05165MaRDI QIDQ378192

Marina Sefovna Nirova, Aleksandr Alekseevich Makhnev

Publication date: 11 November 2013

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

zbMATH Keywords

distance-regular graphedge-symmetricgraph-automorphismintersection array

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) Graph designs and isomorphic decomposition (05C51)

Related Items (2)

Automorphisms of distance regular graph with intersection array \(\{30,27,24;1,2,10\}\) ⋮ Automorphism groups of small distance-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On automorphisms of distance-regular graph with intersection array \(\{15, 12, 1; 1, 2, 15\}\)
• On amply regular locally \(GQ(4,8)\)-graphs
• On automorphisms of distance-regular graph with intersection array \(\{19,16,8;1,2,8\}\)

This page was built for publication: On automorphisms of a distance-regular graph with intersection array \(\{51, 48, 8; 1, 4, 36\}\)