Another construction of edge-regular graphs with regular cliques
classification
🧮 math.CO
keywords
regularedge-regulargraphscliquesconstructionstronglyanotherexhibit
read the original abstract
We exhibit a new construction of edge-regular graphs with regular cliques that are not strongly regular. The infinite family of graphs resulting from this construction includes an edge-regular graph with parameters $(24,8,2)$. We also show that edge-regular graphs with $1$-regular cliques that are not strongly regular must have at least $24$ vertices.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.