On the Clique Number of a Strongly Regular Graph

Electronic Journal Of Combinatorics

Gary R. W. Greaves¹ 

关键词: Delsarte bound;    Hoffman bound;    Block intersection polynomial;    Clique number;    Conference graphs;    Strongly regular graphs;    Clique adjacency bound;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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 p

【 授权许可】

Others