On the complexity of the positive semidefinite zero forcing number (Q5962481): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:29, 30 January 2024
scientific article; zbMATH DE number 6541262
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the positive semidefinite zero forcing number |
scientific article; zbMATH DE number 6541262 |
Statements
On the complexity of the positive semidefinite zero forcing number (English)
0 references
12 February 2016
0 references
positive zero forcing number
0 references
clique cover number
0 references
chordal graphs
0 references
computational complexity
0 references
