On the clique number of a strongly regular graph (Q1991424): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1604.08299 / rank | |||
Normal rank | |||
Revision as of 00:24, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the clique number of a strongly regular graph |
scientific article |
Statements
On the clique number of a strongly regular graph (English)
0 references
30 October 2018
0 references
Summary: We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including infinitely many parameter tuples that correspond to Paley graphs.
0 references
Delsarte bound
0 references
Hoffman bound
0 references
block intersection polynomial
0 references
clique number
0 references
conference graphs
0 references
strongly regular graphs
0 references
clique adjacency bound
0 references
