The color-change rule allows a black vertex to force a white neighbor black if and only if the white vertex is the only white neighbor of the given black vertex. Let Z, a subset of G, be a set of black vertices. Then Z is called a zero forcing set of a graph G if after a finite amount of applications of the color-change rule all vertices in G are forced black. In this talk we will be discussing the color-change rule, zero forcing sets, and the related terms zero forcing number and iteration index. Once these ideas are developed we will look at the zero forcing number and iteration index of some classes of finite graphs.

# Thinking about UNT?

It's easy to apply online. Join us and discover why we're the choice of over **38,000** students.