t-Pebbling in k-connected diameter two graphs

arXiv1903.00554MaRDI QIDQ6314895FDOQ6314895

Authors: L. Alcón, M. Gutierrez, Glenn H. Hurlbert 

Publication date: 1 March 2019

Abstract: Graph pebbling models the transportation of consumable resources. As two pebbles move across an edge, one reaches its destination while the other is consumed. 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 two graphs is well-studied. Here we investigate the $t$-pebbling number of diameter two graphs under the lense of connectivity.

Mathematics Subject Classification ID

Connectivity (05C40) Structural characterization of families of graphs (05C75) Graph theory (05C99)

This page was built for publication: $t$-Pebbling in $k$-connected diameter two graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6314895)