Critical Graphs for the Positive Definite Completion Problem
DOI10.1137/S0895479897324573zbMATH Open0924.15020MaRDI QIDQ4243496FDOQ4243496
Authors: Charles R. Johnson, Raphael Loewy, Wayne Barrett 
Publication date: 18 May 1999
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Recommendations
- The positive definite completion problem revisited
- The cycle completable graphs for the completely positive and doubly nonnegative completion problems
- scientific article; zbMATH DE number 2202148
- On completely positive graphs and their complements
- The real positive semidefinite completion problem for series-parallel graphs
- The completable digraphs for the totally nonnegative completion problem
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
- A note on completely positive graphs
- The completely positive and doubly nonnegative completion problems
- A new graph parameter related to bounded rank positive semidefinite matrix completions
critical graphmatrix completion problempositive definite completioncritical positive definite matrixultraconnected graph
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Structural characterization of families of graphs (05C75)
Cited In (6)
- Null spaces of correlation matrices
- Symmetric completions of cycles and bipartite graphs
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
- Linearly constrained positive definite completions
- Title not available (Why is that?)
- The cycle completable graphs for the completely positive and doubly nonnegative completion problems
This page was built for publication: Critical Graphs for the Positive Definite Completion Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243496)
