Abstract
Graph pebbling is the study of moving discrete pebbles from certain initial distributions on the vertices of a graph to various target distributions via pebbling moves. A pebbling move removes two pebbles from a vertex and places one pebble on one of its neighbors (losing the other as a toll). For t ≥ 1 the t-pebbling number of a graph is the minimum number of pebbles necessary so that from any initial distribution of them it is possible to move t pebbles to any vertex. We provide the best possible upper bound on the t-pebbling number of a diameter two graph, proving a conjecture of Curtis et al., in the process. We also give a linear time (in the number of edges) algorithm to t-pebble such graphs, as well as a quartic time (in the number of vertices) algorithm to compute the pebbling number of such graphs, improving the best known result of Bekmetjev and Cusack. Furthermore, we show that, for complete graphs, cycles, trees, and cubes, we can allow the target to be any distribution of t pebbles without increasing the corresponding t-pebbling numbers; we conjecture that this behavior holds for all graphs. Finally, we explore fractional and optimal fractional versions of pebbling, proving the fractional pebbling number conjecture of Hurlbert and using linear optimization to reveal results on the optimal fractional pebbling number of vertex-transitive graphs.
Similar content being viewed by others
References
Bekmetjev A., Cusack C.: Pebbling algorithms in diameter two graphs. SIAM J. Discret. Math. 23(2), 634–646 (2009)
Blasiak A., Schmitt J.: Degree sum conditions in graph pebbling. Australas. J. Combin. 42, 83–90 (2008)
Bukh B.: Maximum pebbling numbers of graphs of diameter three. J. Graph Theory 52, 353–357 (2006)
Bunde D.P., Chambers E.W., Cranston D., Milans K., West D.B.: Pebbling and optimal pebbling in graphs. J. Graph Theory 57, 215–238 (2008)
Chung F.R.K.: Pebbling in hypercubes. SIAM J. Discret. Math. 2(4), 467–472 (1989)
Clarke T.A., Hochberg R.A., Hurlbert G.H.: Pebbling in diameter two graphs and products of paths. J. Graph Theory 25, 119–128 (1997)
Curtis D., Hines T., Hurlbert G., Moyer T.: On pebbling graphs by their blocks. Integers. Electron. J. Combin. Number Theory 9(#G2), 411–422 (2009)
Herscovici D.S.: Graham’s pebbling conjecture on products of cycles. J. Graph Theory 42(2), 141–154 (2003)
Hurlbert, G.: The graph pebbling page. http://mingus.la.asu.edu/~hurlbert/pebbling/pebb.html
Moews D.: Optimally pebbling hypercubes and powers. Discret. Math. 190, 271–276 (1998)
Pachter L., Snevily H.S., Voxman B.: On pebbling graphs. Congr. Numer. 107, 65–80 (1995)
Postle, L., Streib, N., Yerger, C.: Pebbling graphs of diameter three and four. In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009). Electron. Notes Discrete Math., vol. 34, pp. 21–28. Elsevier, Amsterdam (2009)
Scheinerman, E.R., Ullman, D.H.: Fractional Graph Theory: A Rational Approach to the Theory of Graphs. Wiley, New York (1997)
Watson, N.: The complexity of pebbling and cover pebbling (2005). http://arXiv.org/abs/math.CO/0503511
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Herscovici, D.S., Hester, B.D. & Hurlbert, G.H. t-Pebbling and Extensions. Graphs and Combinatorics 29, 955–975 (2013). https://doi.org/10.1007/s00373-012-1152-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-012-1152-4