The real positive semidefinite completion problem for series-parallel graphs (Q676039): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2111230388 / rank | |||
Normal rank | |||
Revision as of 23:55, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The real positive semidefinite completion problem for series-parallel graphs |
scientific article |
Statements
The real positive semidefinite completion problem for series-parallel graphs (English)
0 references
11 May 1997
0 references
The author considers the partial real symmetric matrices \(X\) whose diagonal entries are equal to 1 and off-diagonal entries are specified only on a subset of the positions. The author gives a set of necessary conditions for \(X\) to be completable to a positive semidefinite matrix, and shows that these conditions are also sufficient if and only if the graph corresponding to the positions of the specified entries has no \(K_4\)-minor.
0 references
real symmetric matrices
0 references
positive semidefinite matrix
0 references
