DisCoMath Seminar: Zero Forcing Game and Some of Its Variants
Discrete & Computational Math Seminar (DisCoMath)
Zero Forcing Game and Some of Its Variants
Dr. Shahla Nasserasr
Assistant Professor
School of Mathematical Sciences, RIT
Abstract:
Zero forcing of a graph is a color-change rule on the vertices of the graph using two colors. This a one-player game and the goal is to color all of the vertices with the same color (following the rules). The color-change rule and the number of players can vary depending on the underlying problem and matrices. In this talk we will review some variants of zero forcing and their properties.
Speaker Bio:
Dr. Nasserasr is an Assistant Professor in the School of Mathematical Sciences at RIT. She received her Ph.D. in matrix analysis from the College of William and Mary in 2010. Prior to joining RIT in 2020, she was an Associate Professor of Mathematics at Brandon University, Canada. Her research interests include combinatorial matrix theory, inverse eigenvalue problem, totally positive matrices, and graph theory."
Intended Audience:
Undergraduates, graduates, and experts. Those with interest in the topic.
Keep up with DisCoMath Seminars on the DisCoMathS webpage.
To request an interpreter, please visit myaccess.rit.edu
Event Snapshot
When and Where
Who
Open to the Public
Interpreter Requested?
No