Name
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. |
Year | Venue | Field |
|---|---|---|
2018 | ELECTRONIC JOURNAL OF COMBINATORICS | Discrete mathematics,Block graph,Indifference graph,Combinatorics,Strongly regular graph,Two-graph,Clique-sum,Chordal graph,Treewidth,Mathematics,Split graph |
DocType | Volume | Issue |
Journal | 25 | 4 |
ISSN | Citations | PageRank |
1077-8926 | 1 | 0.42 |
References | Authors | |
4 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gary Greaves | 1 | 18 | 6.39 |
| Leonard H. Soicher | 2 | 48 | 10.38 |