Back to Search
Start Over
SPN completable graphs.
- Source :
-
Linear Algebra & its Applications . Jun2016, Vol. 498, p58-73. 16p. - Publication Year :
- 2016
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 498
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 114052691
- Full Text :
- https://doi.org/10.1016/j.laa.2014.10.021