Another construction of edge-regular graphs with regular cliques
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.