Zero Forcing and Its Applilations
Michael Young
Mathematics Department
Iowa State University
Zero forcing is a type of propagation on a simple, undirected graph based on the color-change rule: Given graph $G$, if each vertex of $G$ is colored either white or blue, and vertex $v$ is a blue vertex with only one white neighbor $w$, then change the color of $w$ to blue. In this talk will discuss the role of zero forcing in systems control, electrical engineer, and linear algebra.