A lower bound for minimum positive semidefinite rank by constructing an OS-vertex set for a given graph (Q2900666)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lower bound for minimum positive semidefinite rank by constructing an OS-vertex set for a given graph |
scientific article; zbMATH DE number 6059616
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for minimum positive semidefinite rank by constructing an OS-vertex set for a given graph |
scientific article; zbMATH DE number 6059616 |
Statements
23 July 2012
0 references
A lower bound for minimum positive semidefinite rank by constructing an OS-vertex set for a given graph (English)
0 references
