| Naslov: | Bootstrap percolation in strong products of graphs |
|---|
| Avtorji: | ID Brešar, Boštjan (Avtor)
ID Hedžet, Jaka (Avtor) |
|---|
| Datoteke: |  PDF - Predstavitvena datoteka, prenos (649,39 KB)
MD5: 0221CDEFE7DA9103CF5B6F6C2C59DC4F
 URL - Izvorni URL, za dostop obiščite https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i4p35
|
|---|
| Jezik: | Angleški jezik |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: |  IMFM - Inštitut za matematiko, fiziko in mehaniko
|
|---|
| Povzetek: | Given a graph $G$ and assuming that some vertices of $G$ are infected, the $r$-neighbor bootstrap percolation rule makes an uninfected vertex $v$ infected if $v$ has at least $r$ infected neighbors. The $r$-percolation number, $m(G,r)$, of $G$ is the minimum cardinality of a set of initially infected vertices in $G$ such that after continuously performing the $r$-neighbor bootstrap percolation rule each vertex of $G$ eventually becomes infected. In this paper, we consider percolation numbers of strong products of graphs. If $G$ is the strong product $G_1\boxtimes \cdots \boxtimes G_k$ of $k$ connected graphs, we prove that $m(G,r)=r$ as soon as $r\le 2^{k-1}$ and $|V(G)|\ge r$. As a dichotomy, we present a family of strong products of $k$ connected graphs with the $(2^{k-1}+1)$-percolation number arbitrarily large. We refine these results for strong products of graphs in which at least two factors have at least three vertices. In addition, when all factors $G_i$ have at least three vertices we prove that $m(G_1 \boxtimes \dots \boxtimes G_k,r)\leq 3^{k-1} -k$ for all $r\leq 2^k-1$, and we again get a dichotomy, since there exist families of strong products of $k$ graphs such that their $2^{k}$-percolation numbers are arbitrarily large. While $m(G\boxtimes H,3)=3$ if both $G$ and $H$ have at least three vertices, we also characterize the strong prisms $G\boxtimes K_2$ for which this equality holds. Some of the results naturally extend to infinite graphs, and we briefly consider percolation numbers of strong products of two-way infinite paths. |
|---|
| Ključne besede: | bootstrap percolation, strong product of graphs, infinite path |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Datum objave: | 01.01.2024 |
|---|
| Leto izida: | 2024 |
|---|
| Št. strani: | 22 str. |
|---|
| Številčenje: | Vol. 31, iss. 4, article no. P4.35 |
|---|
| PID: | 20.500.12556/DiRROS-20844  |
|---|
| UDK: | 519.17:519.2 |
|---|
| ISSN pri članku: | 1077-8926 |
|---|
| DOI: | 10.37236/11826 |
|---|
| COBISS.SI-ID: | 215693827 |
|---|
| Opomba: |
|
|---|
| Datum objave v DiRROS: | 20.11.2024 |
|---|
| Število ogledov: | 88 |
|---|
| Število prenosov: | 44 |
|---|
| Metapodatki: |    |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
