On the clique number of a strongly regular graph

zbMath1398.05150arXiv1604.08299MaRDI QIDQ1991424

Leonard H. Soicher, Gary R. W. Greaves

Publication date: 30 October 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

strongly regular graphsclique numberHoffman boundDelsarte boundblock intersection polynomialconference graphsclique adjacency bound

Mathematics Subject Classification ID

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

Related Items (4)

On the clique number of Paley graphs of prime power order ⋮ Critical groups of strongly regular graphs and their generalizations ⋮ Upper bounds on the size of transitive subtournaments in digraphs ⋮ Bounds for regular induced subgraphs of strongly regular graphs

Uses Software

• Magma
• Maple

Cites Work

• On cliques in edge-regular graphs
• Spectra of graphs
• More on block intersection polynomials and new applications to graphs and block designs
• On the distribution of \(p^{\theta}\,mod\,1\)
• The Magma algebra system. I: The user language
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• Squares and difference sets in finite fields
• HEMISYSTEMS ON THE HERMITIAN SURFACE
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the clique number of a strongly regular graph