On the Dual of the Lovász Theta Prime Number for the Disjunctive Product of Graphs

The Lovász theta function, and the variants of it given by Schrijver and Szegedy are upper bounds on the independence number of a graph. These functions play an important role in several optimization problems, such as the Cohn-Elkies bound for optimal sphere packing densities.<br/><br/>This thesis covers the properties of these functions. The...