Pebbling and optimal pebbling in graphs

Abstract

Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number Π(G) is the least k such that for every distribution of k pebbles and every vertex r, a pebble can be moved to r. The optimal pebbling number ΠOPT (G) is the least k such that some distribution of k pebbles permits reaching each vertex. Using new tools (such as the “Squishing” and “Smoothing” Lemmas), we give short proofs of prior results on these parameters for paths, cycles, trees, and hypercubes, a new linear-time algorithm for computing Π(G) on trees, and new results on ΠOPT (G). If G is connected and has n vertices, then ΠOPT (G) ≤ ⌈2n/3⌉ (sharp for paths and cycles). Let an,k be the maximum of ΠOPT (G) when G is a connected n-vertex graph with δ(G) ≥ k. Always 2 ⌈

DOI: 10.1002/jgt.20278

Extracted Key Phrases

Cite this paper

@article{Bunde2008PebblingAO, title={Pebbling and optimal pebbling in graphs}, author={David P. Bunde and Erin W. Chambers and Daniel W. Cranston and Kevin G. Milans and Douglas B. West}, journal={Journal of Graph Theory}, year={2008}, volume={57}, pages={215-238} }