Pinnacles on Graphs Mr. Stephen Lasinis Undergraduate University of Wisconsin – Milwaukee We consider graphs that are simple, finite, connected, and undirected, and a bijective labeling on the vertices of the graph with the integers 1, 2, ..., n where... Read More
A variation of zero forcing: leaky forcing Dr. Ryan Moruzzi Jr Assistant Professor of Mathematics California State University, East Bay Zero forcing on a graph is an iterative graph coloring process where, starting with an initial set of blue vertices,... Read More