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 the normal view instead:
scientific article; zbMATH DE number 6059616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8677380084991455
0 references
0.8622990846633911
0 references
0.8572086691856384
0 references
0.8269758820533752
0 references
0.8108590841293335
0 references
