Automorphisms of Higman graphs with =6
From MaRDI portal
Publication:492297
DOI10.1134/S0081543815050223zbMATH Open1319.05156MaRDI QIDQ492297FDOQ492297
Authors: Natal'ya Dmitrievna Zyulyarkina, Alexandre A. Makhnev
Publication date: 20 August 2015
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Recommendations
- Small vertex-symmetric Higman graphs with \(\mu=6\)
- On automorphisms of strongly regular graph with parameters \((96, 60, 38, 36)\)
- On automorphisms of strongly regular graphs with parameters (486, 100, 22, 20)
- On automorphisms of strongly regular graphs with $\lambda=0$ and $\mu=3$
- On automorphisms of strongly regular graphs with $ \lambda=0$, $ \mu=2$
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Association schemes, strongly regular graphs (05E30)
Cites Work
- The Gewirtz graph: An exercise in the theory of graph spectra
- Title not available (Why is that?)
- Search for properties of the missing Moore graph
- Title not available (Why is that?)
- Regular two-graphs on 36 vertices
- The Finite Primitive Permutation Groups of Rank Three
- Characterization of families of rank 3 permutation groups by the subdegrees. I
- Automorphisms of semitriangular graphs with \(\mu = 6\)
Cited In (4)
This page was built for publication: Automorphisms of Higman graphs with \(\mu=6\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492297)