Bounding the CP-rank by graph parameters (Q5502160)
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 6473083
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding the CP-rank by graph parameters |
scientific article; zbMATH DE number 6473083 |
Statements
Bounding the CP-rank by graph parameters (English)
0 references
17 August 2015
0 references
completely positive matrices
0 references
cp-rank
0 references
clique covering number
0 references
maximum size triangle free subgraph
0 references
outerplanar graph
0 references
0.8673263788223267
0 references
0.8668445944786072
0 references
0.8510850667953491
0 references
0.8026460409164429
0 references
0.7808586955070496
0 references
