On automorphisms of semitriangular graphs with \(\mu = 7\)

DOI10.1134/S1064562411040077zbMath1243.05170MaRDI QIDQ656373

Aleksandr Alekseevich Makhnev, Natal'ya Dmitrievna Zyulyarkina

Publication date: 17 January 2012

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

zbMATH Keywords

strongly regular graphautomorphism: semitriangular graph

Mathematics Subject Classification ID

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

Related Items (3)

On automorphisms of semitriangular graphs with \(\mu = 8\) ⋮ Vertex-transitive semi-triangular graphs with \(\mu=7\) ⋮ Edge-symmetric semitriangular Higman graphs

Cites Work

• Unnamed Item
• On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)
• Automorphisms of semitriangular graphs with \(\mu = 6\)
• Characterization of families of rank 3 permutation groups by the subdegrees. I

This page was built for publication: On automorphisms of semitriangular graphs with \(\mu = 7\)