Abstract
We study 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 , we are interested in , the minimum number of rounds until the information has spread to all vertices of graph . We are also interested in finding , the minimum number of sources necessary so that the information spreads to all vertices of in rounds. In addition to general results, we find and for the classes of spiders and wheels and show that their behavior differs with respect to these two parameters. We also provide examples and prove upper bounds for these parameters for Cartesian products of graphs.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call