Abstract
The pebbling number of a graph G, f(G), is the least n such that, no matter how n pebbles are placed on the vertices of G, we can move a pebble to any vertex by a sequence of moves, each move taking two pebbles off one vertex and placing one on an adjacent vertex. Graham conjectured that for any connected graphs G and H, f( G x H) ⩽ f( G) f( H). We show that Graham’s conjecture holds true of a complete bipartite graph by a graph with the two-pebbling property. As a corollary, Graham’s conjecture holds when G and H are complete bipartite graphs.
Similar content being viewed by others
References
Chung, F. R. K., Pebbling in hypercubes, SIAM J. Discrete Math., 1989, 2: 461–472.
Moewa, D., Pebbling graphs, J. Combin. Theory, Ser. B, 1992, 55: 244–252.
Herscovici, D. S., Higgins, A. W., The pebbling number of C5 x C5, Discrete Math., 1998, 189: 123–135
Pachter, L., Snevily, H. S., Voxman, B., On pebbling graphs, Congr. Numer., 1995, 107: 65–80.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Feng, R., Kim, J.Y. Graham’s pebbling conjecture on product of complete bipartite graphs. Sci. China Ser. A-Math. 44, 817–822 (2001). https://doi.org/10.1007/BF02880130
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02880130