Search
Now showing items 1-1 of 1
On the complexity of the positive semidefinite zero forcing number
(Elsevier, 2015)
The positive semidefinite zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring and is related to a more conventional version of zero forcing. We establish a relation ...