Back to Search
Start Over
On the clique number of a strongly regular graph
- Source :
- Electron. J. Combin. 25 (2018), no. 4, #P4.15
- Publication Year :
- 2016
-
Abstract
- 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.<br />Comment: 13 pages
- Subjects :
- Mathematics - Combinatorics
Subjects
Details
- Database :
- arXiv
- Journal :
- Electron. J. Combin. 25 (2018), no. 4, #P4.15
- Publication Type :
- Report
- Accession number :
- edsarx.1604.08299
- Document Type :
- Working Paper