regular graphs on at most $150$ vertices to which we can apply either Theorem \[thm:beatDelsarteConf\] or Theorem \[thm:beatDelsarteNonConf\]. In other words, Table \[tab:bd\] displays the feasible parameters for strongly regular graphs on at most $150$ vertices for which the clique adjacency bound is strictly less than the Delsarte bound. In the column labelled ‘Exists’, if there exists a strongly regular graph with the appropriate parameters then we put ‘+’, or ‘!’ if the graph is known to be unique; otherwise, if the existence is unknown, we put ‘?’. In the final column of Table \[tab:bd\], we put ‘Y’ (resp. ‘N’) if there exists (resp. does not exist) a strongly regular graph with the corresponding parameters that has clique number equal to the clique adjacency bound, otherwise we put a ‘?’ if such existence is unknown. We refer to Brouwer’s website [@Brouwer:URL] for details on the existence of strongly regular graphs with given parameters.

For the parameter tuples in Table \[tab:bd\], the Delsarte bound is equal to the clique adjacency bound plus $1$. As an example of a parameter tuple for which the clique adjacency bound differs from the Delsarte bound by $2$, we have $(378,52,1,8)$ for which there exists a 