Conic Programming: Bounding Sums of Squares of Graph Eigenvalues

This research paper explores the application of conic programming, specifically semidefinite programming (SDP), to establish novel bounds on sums of squares of positive and negative eigenvalues of graph adjacency matrices, connecting them to graph properties like vector chromatic number and clique number.