The smallest strictly Neumaier graph and its generalisations (Q2420557): Difference between revisions

Summary: A regular clique in a regular graph is a clique such that every vertex outside of the clique is adjacent to the same positive number of vertices inside the clique. We continue the study of regular cliques in edge-regular graphs initiated by A. Neumaier in the 1980s [\textit{A. Neumaier}, Discrete Math. 106/107, 353--360 (1992; Zbl 0754.94010); Lond. Math. Soc. Lect. Note Ser. 49, 244--259 (1981; Zbl 0466.05026)] and attracting current interest. We thus define a Neumaier graph to be an non-complete edge-regular graph containing a regular clique, and a strictly Neumaier graph to be a non-strongly regular Neumaier graph. We first prove some general results on Neumaier graphs and their feasible parameter tuples. We then apply these results to determine the smallest strictly Neumaier graph, which has 16 vertices. Next we find the parameter tuples for all strictly Neumaier graphs having at most 24 vertices. Finally, we give two sequences of graphs, each with \(i^{th}\) element a strictly Neumaier graph containing a \(2^{i}\)-regular clique (where \(i\) is a positive integer) and having parameters of an affine polar graph as an edge-regular graph. This answers questions recently posed by \textit{G. R. W. Greaves} and \textit{J. H. Koolen} [Eur. J. Comb. 71, 194--201 (2018; Zbl 1387.05272)].