Another construction of edge-regular graphs with regular cliques

DOI10.1016/J.DISC.2018.09.032zbMath1417.05249arXiv1810.07454OpenAlexW2963547165WikidataQ128909250 ScholiaQ128909250MaRDI QIDQ2317649

Jack H. Koolen, Gary R. W. Greaves

Publication date: 12 August 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

strongly regular graphedge-regular graphregular clique

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (4)

Neumaier graphs with few eigenvalues ⋮ A general construction of strictly Neumaier graphs and a related switching ⋮ On the Existence of Small Strictly Neumaier Graphs ⋮ An infinite class of Neumaier graphs and non-existence results

Cites Work

• Unnamed Item
• Unnamed Item
• Spectra of graphs
• Distance regular graphs of diameter 3 and strongly regular graphs
• Cayley-Deza graphs with fewer than 60 vertices
• Distance regular covers of the complete graph
• Edge-regular graphs with regular cliques
• The smallest strictly Neumaier graph and its generalisations

This page was built for publication: Another construction of edge-regular graphs with regular cliques