SPN completable graphs

An SPN matrix is a matrix which is the sum of a real positive semidefinite matrix and a symmetric nonnegative one. We solve the SPN completion problem: we show that the SPN completable graphs are the graphs in which every odd cycle induces a complete subgraph.