Computing positive semidefinite minimum rank for small graphs (Q399449)
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 6331663
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing positive semidefinite minimum rank for small graphs |
scientific article; zbMATH DE number 6331663 |
Statements
Computing positive semidefinite minimum rank for small graphs (English)
0 references
19 August 2014
0 references
zero forcing number
0 references
maximum nullity
0 references
minimum rank
0 references
positive semidefinite
0 references
0.8625320196151733
0 references
0.8496705889701843
0 references
0.8079627156257629
0 references
0.8032646179199219
0 references
0.802620530128479
0 references
