Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2510.05170 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918155442454528 |
|---|---|
| author | Wang, Runze |
| author_facet | Wang, Runze |
| contents | In a graph $G$, we define a set of vertices to be a \emph{strong hub set} if for any two vertices in $G$, we can find a path between them whose internal vertices are all in this set. We define the \emph{strong hub cover pebbling number} of $G$, denoted by $h_s^*(G)$, to be the smallest $t$ such that for any initial configuration with $t$ pebbles on $G$, we can make some pebbling moves (a pebbling move consists of removing two pebbles from a vertex $v$ and adding one pebble to another vertex adjacent to $v$) so that there is a strong hub set with every vertex in it having a pebble. We determine the strong hub cover pebbling numbers of paths, stars, and books. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_05170 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Strong hub cover pebbling number Wang, Runze Combinatorics 05C57 In a graph $G$, we define a set of vertices to be a \emph{strong hub set} if for any two vertices in $G$, we can find a path between them whose internal vertices are all in this set. We define the \emph{strong hub cover pebbling number} of $G$, denoted by $h_s^*(G)$, to be the smallest $t$ such that for any initial configuration with $t$ pebbles on $G$, we can make some pebbling moves (a pebbling move consists of removing two pebbles from a vertex $v$ and adding one pebble to another vertex adjacent to $v$) so that there is a strong hub set with every vertex in it having a pebble. We determine the strong hub cover pebbling numbers of paths, stars, and books. |
| title | Strong hub cover pebbling number |
| topic | Combinatorics 05C57 |
| url | https://arxiv.org/abs/2510.05170 |