{
  "id": "1810.07454",
  "version": "v1",
  "published": "2018-10-17T09:49:04.000Z",
  "updated": "2018-10-17T09:49:04.000Z",
  "title": "Another construction of edge-regular graphs with regular cliques",
  "authors": [
    "Gary R. W. Greaves",
    "J. H. Koolen"
  ],
  "comment": "7 pages",
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-10-17T09:49:04.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "edge-regular graph",
      "regular cliques",
      "construction"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}