Abstract
Chung defined a pebbling move on a graphG as the removal of two pebbles from one vertex and the addition of one pebble to an adjacent vertex. The pebbling number of a connected graphG, f(G), is the leastn such that any distribution ofn pebbles onG allows one pebble to be moved to any specified but arbitrary vertex by a sequence of pebbling moves. Graham conjectured that for any connected graphsG andH, f(G xH) ≤ f(G)f(H). In the present paper the pebbling numbers of the product of two fan graphs and the product of two wheel graphs are computed. As a corollary, Graham’s conjecture holds whenG andH are fan graphs or wheel graphs.
Similar content being viewed by others
References
Chung, F. R. K., Pebbling in hyercubes, SIAM J. Discrete Math., 1989, 2: 461–472.
Feng, R., Kim, J., Graham’s pebbling conjecture of product of complete bipartite graphs, Science in China, Ser. A, 2001, 44(7): 817–822.
Moews, D., Pebbling graphs, J. Combin. Theory, Ser. B, 1992, 55: 244–252.
Herscovici, D. S., Higgins, A. W., The pebbling number of C5 × C5, Discrete Math., 1998, 189: 123–135.
Pachter, L., Snevily, H. S., Voxman, B., On pebbling graphs, Congr. Numer., 1995, 107: 65–80.
Snevily, H. S., Foster, J. A., The 2-pebbling property and a conjecture of Graham, Graphs and Combinatories, 2000, 16: 231–244.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Feng, R., Kim, J.Y. Pebbling numbers of some graphs. Sci. China Ser. A-Math. 45, 470–478 (2002). https://doi.org/10.1007/BF02872335
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02872335