Now showing items 1-3 of 3
On the complexity of the positive semidefinite zero forcing number
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
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 ...
Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of a Graph
(Wiley Periodicals, Inc., 2013)
Tree-width, and variants that restrict the allowable tree decompositions, play an important role in the study of graph algorithms and have application to computer science. The zero forcing number is used to study the ...