Geodesic
On the clique number of a strongly regular graph
The electronic journal of combinatorics, Tome 25 (2018) no. 4

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv
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.
DOI : 10.37236/7873
Classification : 05C69, 05E30
Mots-clés : Delsarte bound, Hoffman bound, block intersection polynomial, clique number, conference graphs, strongly regular graphs, clique adjacency bound 
Gary R. W. Greaves; Leonard H. Soicher. On the clique number of a strongly regular graph. The electronic journal of combinatorics, Tome 25 (2018) no. 4. doi: 10.37236/7873
@article{10_37236_7873,
     author = {Gary R. W. Greaves and Leonard H. Soicher},
     title = {On the clique number of a strongly regular graph},
     journal = {The electronic journal of combinatorics},
     year = {2018},
     volume = {25},
     number = {4},
     doi = {10.37236/7873},
     zbl = {1398.05150},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/7873/}
}
TY  - JOUR
AU  - Gary R. W. Greaves
AU  - Leonard H. Soicher
TI  - On the clique number of a strongly regular graph
JO  - The electronic journal of combinatorics
PY  - 2018
VL  - 25
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/7873/
DO  - 10.37236/7873
ID  - 10_37236_7873
ER  - 
%0 Journal Article
%A Gary R. W. Greaves
%A Leonard H. Soicher
%T On the clique number of a strongly regular graph
%J The electronic journal of combinatorics
%D 2018
%V 25
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/7873/
%R 10.37236/7873
%F 10_37236_7873

Cité par Sources :