On automorphisms of semitriangular graphs with = 7

DOI10.1134/S1064562411040077zbMATH Open1243.05170MaRDI QIDQ656373FDOQ656373

Authors: Natal'ya Dmitrievna Zyulyarkina, Alexandre A. Makhnev 

Publication date: 17 January 2012

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

Recommendations

• Automorphisms of semitriangular graphs with \(\mu = 6\)
• Vertex-transitive semi-triangular graphs with \(\mu=7\)
• On automorphisms of strongly regular graphs with $\lambda=0$ and $\mu=3$
• Automorphisms of Higman graphs with \(\mu=6\)
• On strongly regular graphs with \(\mu = 1\) and their automorphisms

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)

Cites Work

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

Cited In (5)

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

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

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