Edge-regular graphs with regular cliques

DOI10.1016/j.ejc.2018.04.004zbMath1387.05272arXiv1708.05977OpenAlexW2963563387MaRDI QIDQ1750219

Jack H. Koolen, Gary R. W. Greaves

Publication date: 18 May 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.05977

zbMATH Keywords

strongly regular graphstransversal designspolar spaces1,5-designs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Neumaier graphs with few eigenvalues ⋮ A general construction of strictly Neumaier graphs and a related switching ⋮ The smallest strictly Neumaier graph and its generalisations ⋮ On strictly Deza graphs with parameters \((n, k, k - 1, a)\) ⋮ Another construction of edge-regular graphs with regular cliques ⋮ An infinite class of Neumaier graphs and non-existence results

Cites Work

• On cliques in edge-regular graphs
• Spectra of graphs
• Cayley-Deza graphs with fewer than 60 vertices
• The smallest strictly Neumaier graph and its generalisations
• Cyclotomic numbers, coding theory and orthogonal polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge-regular graphs with regular cliques