A note on the stability number of an orthogonality graph
European Journal of Combinatorics
On the Lovász δ-number of almost regular graphs with application to Erdős-Rényi graphs
European Journal of Combinatorics
Commutative association schemes
European Journal of Combinatorics
Tightening a copositive relaxation for standard quadratic optimization problems
Computational Optimization and Applications
| Hi-index | 754.84 |
Delsarte's linear programming bound (an upper bound on the cardinality of cliques in association schemes) is compared with Lovacute{a}sz'stheta-function bound (an upper bound on the Shannon capacity of a graph). The two bounds can be treated in a uniform fashion. Delsarte's linear programming bound can be generalized to a boundtheta prime(G)on the independence numberpropto(G)of an arbitrary graphG, such thattheta prime(G) leq theta(G). On the other hand, if the edge set ofGis a union of classes of a symmetric association scheme,theta(G)may be calculated by linear programming, For such graphs the producttheta(G).theta(G)is equal to the number of vertices ofG.