  We extend the clique-coclique inequality, previously known to hold for graphs
in association schemes and vertex-transitive graphs, to graphs in homogeneous
coherent configurations and 1-walk regular graphs. We further generalize it to
a stronger inequality involving the Lov\'asz theta number of such graphs, and
some theta variants, including characterizations of the equality.
