05C50 Online Seminar: S. Ahmad Mojallal
Topic
The q-analogue of zero forcing on threshold graphs
Speakers
Details
Zero forcing is a combinatorial game played on a graph with the ultimate goal of changing the colour of all the vertices at a minimal cost. Originally this game was conceived as a one-player game, but later a two-player version was devised in-conjunction with studies on the inertia of a graph, and has become known as the q-analogue of zero forcing.
In this talk, we study and compute the q-analogue zero forcing number for threshold graphs.
The slides and a recording of this talk will be shared on the main website.
Additional Information
The 05C50 Online is an international seminar about graphs and matrices held twice a month on Fridays.
Time: 8AM Pacific/10AM Central
For more information, visit https://sites.google.com/view/05c50online/home.
If you would like to attend, please register using this form to receive the zoom links: https://docs.google.com/forms/d/e/1FAIpQLSdQ98fh58cgeSWzbFe3t77i28FXDck1gYuX9jv_qd4kEf5l_Q/viewform?usp=sf_link