t-Pebbling in k-connected graphs with a universal vertex
The t-pebbling number is the smallest integer m so that any initially distributed supply of m pebbles can place t pebbles on any target vertex via pebbling moves. The 1-pebbling number of diameter 2 graphs is well-studied. Here we investigate the t-pebbling number of diameter 2 graphs under the lens...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2018
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/162597 |
| Aporte de: |
| Sumario: | The t-pebbling number is the smallest integer m so that any initially distributed supply of m pebbles can place t pebbles on any target vertex via pebbling moves. The 1-pebbling number of diameter 2 graphs is well-studied. Here we investigate the t-pebbling number of diameter 2 graphs under the lens of connectivity. |
|---|