Hemisystems and strongly regular graphs
In a recent paper, it was constructed a family of hemisystems of H(3,p2), for every prime p of the form p=1+4a2, stabilised by PSL(2,p)×C[Formula presented]. In the case p=5, the full automorphism group is 3.A7, and the hemisystem is isomorphic to a sporadic one described by A. Cossidente and T. Penttila in 2005. Here, we investigate the new family of hemisystems and the related strongly regular graphs. In this way, we find a new family of strongly regular graphs, cospectral but not isomorphic to the Cossidente–Penttila graph.
Authors
- Vincenzo Pallozzi Lavorante (ORCID: https://orcid.org/0000-0002-8725-5473)
- Valentino Smaldore (ORCID: https://orcid.org/0000-0003-3433-3164)
- Federico Romaniello (ORCID: https://orcid.org/0000-0003-1166-3179)
Publication Details
- Journal
- Discrete Applied Mathematics
- Published
- 2025-08-09
- DOI
- https://doi.org/10.1016/j.dam.2025.07.041
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00