Augmenting the Delsarte bound: a forbidden interval for the order of maximal cliques in strongly regular graphs

DOI10.1016/j.ejc.2021.103384zbMath1473.05323OpenAlexW3180460378MaRDI QIDQ2048358

Jack H. Koolen, Jongyook Park, Gary R. W. Greaves

Publication date: 5 August 2021

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2021.103384

zbMATH Keywords

strongly regular graphcliquesDelsarte cliqueHoffman boundDelsarte boundCvetković boundcocliques

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (1)

There does not exist a strongly regular graph with parameters \((1911, 270, 105, 27)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of graphs
• Shilla distance-regular graphs
• Strongly regular graphs with smallest eigenvalue -m
• Interlacing eigenvalues and graphs
• On the Koolen-Park inequality and Terwilliger graphs
• There does not exist a distance-regular graph with intersection array \(\{80, 54,12; 1, 6, 60\}\)
• Hoffman's ratio bound

This page was built for publication: Augmenting the Delsarte bound: a forbidden interval for the order of maximal cliques in strongly regular graphs