Atlantic Graph Theory Seminar

Speaker: Ann Trenk, Wellesley College

Abstract:

We discuss a discrete-time model for the spread of information in a graph, motivated by the idea that people believe a story when they learn of it from two different origins. Similar to the burning number, in this problem, information spreads in rounds and a new source can appear in each round. For a graph $G$, we are interested in $b_2(G)$, the minimum number of rounds until the information has spread to all vertices of graph $G$. We are also interested in finding $t_2(G)$, the minimum number of sources necessary so that the information spreads to all vertices of $G$ in $b_2(G)$ rounds. In addition to discussing general results, we find $b_2(G)$ and $t_2(G)$ for the classes of spiders and wheels and show that their behavior differs with respect to these two parameters.

This is joint work with Catherine Jacobs (Wellesley College) and Margaret-Ellen Messinger (Mount Allison University).

Zoom link:

Meeting ID: 868 6149 9971

Passcode: 325258