Zero forcing (also called graph infection) on a simple, undirected graph $G$ is based on the color-change rule: 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. A minimum zero forcing set is a set of blue vertices of minimum cardinality that can color the entire graph blue using the color change rule. In this talk will discuss the role of zero forcing in systems control, electrical engineer, and linear algebra. Even though various scientist have been using zero forcing, it wasn't until recently that it was realized they were all doing the same type of propagation. Zero forcing gets its name from the linear algebraists, who were using the propagation to force entries of a vector to be zero. Sponsored by Fan Chung Graham and Jacques Verstraete