Another construction of edge-regular graphs with regular cliques

Gary R. W. Greaves; J. H. Koolen

Another construction of edge-regular graphs with regular cliques

Combinatorics 2018-10-18 v1

Authors: Gary R. W. Greaves , J. H. Koolen

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.

Keywords

graph theory graph cycles graph pebbling

Cite

@article{arxiv.1810.07454,
  title  = {Another construction of edge-regular graphs with regular cliques},
  author = {Gary R. W. Greaves and J. H. Koolen},
  journal= {arXiv preprint arXiv:1810.07454},
  year   = {2018}
}

Comments

7 pages

Related papers

View all related →