| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6416065 | Linear Algebra and its Applications | 2016 | 16 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Naomi Shaked-Monderer, Abraham Berman, Mirjam Dür, M. Rajesh Kannan,