This paper studies the Shannon capacity of lexicographic products of finite simple graphs, together with the Lovász theta function and the fractional Haemers number. The Shannon capacity is proved to be supermultiplicative under lexicographic products in either order, and these products are compared with the strong product. We explicitly construct three countably infinite families of lexicographic powers based on the Schläfli graph, the McLaughlin graph, and its second subconstituent; in each family, pairing each member with its complement yields strict supermultiplicativity and arbitrarily large multiplicative gaps. Bounds and exact-capacity criteria for lexicographic products are derived, and the resulting upper bounds are shown to be incomparable. The capacities of lexicographic products involving Kneser graphs, their complements, and $q$-analogues of Kneser graphs are determined. It is also shown that a lexicographic product with a complete outer factor preserves the Shannon capacity of an arbitrary inner factor. The capacities of iterated lexicographic powers are determined, including those of self-complementary graphs that are vertex-transitive or strongly regular. Elementary, self-contained proofs are also given for three known results: the multiplicativity of the Lovász theta function and the fractional Haemers number under lexicographic products, and the equality of the fractional and ordinary Lovász theta functions. Finally, an open problem concerning the Shannon capacities of lexicographic and strong products is posed.

翻译：暂无翻译