Now showing items 1-2 of 2

• #### 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 ...
• #### On the relationship between zero forcing number and certain graph coverings ﻿

(2014)
The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced ...