The 2-burning number of a graph
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909387752210432 |
|---|---|
| author | Jacobs, C. B. Messinger, M. E. Trenk, A. N. |
| author_facet | Jacobs, C. B. Messinger, M. E. Trenk, A. N. |
| contents | 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 $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 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. We also provide examples and prove upper bounds for these parameters for Cartesian products of graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_02050 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The 2-burning number of a graph Jacobs, C. B. Messinger, M. E. Trenk, A. N. Combinatorics 05C57 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 $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 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. We also provide examples and prove upper bounds for these parameters for Cartesian products of graphs. |
| title | The 2-burning number of a graph |
| topic | Combinatorics 05C57 |
| url | https://arxiv.org/abs/2411.02050 |