Naomi Shaked-Monderer, CP graphs and SPN graphs, Vol. 2025 (2025), Article ID 3, pp. 1-10

Full Text: PDF
DOI: 10.23952/cot.2025.3

Received November 25, 2023; Accepted March 16, 2024; Published online October 25, 2024

 

Abstract. A graph G is SPN if every copositive matrix realization of it is a sum of a positive semidefinite matrix and a nonnegative one (an SPN matrix). A graph is CP if every doubly nonnegative matrix realization of it is completely positive. This survey describes the current state of the problem of characterizing SPN graphs in comparison to the, by now classical, characterization of CP graphs, which inspired the attempt to define and study SPN graphs.

 

How to Cite this Article:
N. Shaked-Monderer, CP graphs and SPN graphs, Commun. Optim. Theory 2025 (2025) 3.