Zero forcing parameters for graphs
PhD Student supervised by S. Fallat and K. Meagher
Monday November 7th
Math & Stats Lounge (CW 307.20)
Abstract: The interaction between linear algebra, graph theory, and combina-
torics has developed into a substantial discipline, known as "combinatorial matrix
theory". Pattern classes of matrices represent an important part of this discipline.
A graph or digraph describes the zero-nonzero pattern of a family of matrices.
A minimum rank problem is to determine the minimum among the ranks of
the matrices in one of these families. Considerable progress has been made on
the minimum rank problem for the family of symmetric matrices described by a
simple graph (free diagonal), although the problem is far from solved. In this pre-
sentation, we will give a brief introduction on the graph parameters zero forcing
number and positive semidefinite zero forcing number which are powerful tools