Abstract
A pebbling move consists of removing two pebbles from one vertex and then placing one pebble at an adjacent vertex. If a distribution δ of pebbles lets us move at least one pebble to each vertex by applying pebbling moves repeatedly(if necessary), then δ is called a pebbling of G. The optimal pebbling number f′(G) of G is the minimum number of pebbles used in a pebbling of G. In this paper, we improve the known upper bound for the optimal pebbling number of the hypercubes Q n . Mainly, we prove for large n, \(f'(Q_{n})=O(n^{3/2}(\frac {4}{3})^{n})\) by a probabilistic argument.
Similar content being viewed by others
References
Chung FRK (1989) Pebbling in hypercubes. SIAM J Discrete Math 2(4):467–472
Clarke TA, Hochberg RA, Hurlbert GH (1997) Pebbling in diameter two graphs and products of paths. J Graph Theory 25:119–128
Fu HL, Shiue CL (2000) The optimal pebbling number of the complete m-ary tree. Discrete Math 222:89–100
Herscovici DS, Higgins AW (1998) The pebbling number of C 5×C 5. Discrete Math 187:123–135
Lemke P, Kleitman D (1989) An addition theorem on the integers modulo n. J Number Theory 31:335–345
MacWillians FJ, Sloane NJA (1977) The theory of error-correcting codes. North-Holland, New York
Moews D (1992) Pebbling graph. J Comb Theory, Ser B 55:244–252
Moews D (1998) Optimally pebbling hypercubes and powers. Discrete Math 190:271–276
Pachter L, Snevily H, Voxman B (1995) On pebbling graph. Congr Numer 107:65–80
Shiue CL (1999) Optimally pebbling graphs. PhD Dissertation, Department of Applied Mathematics, National Chiao Tung University, Hsin chu, Taiwan
Shiue CL, Fu HL (2009) The optimal pebbling number of the caterpillar. Taiwan J Math 13(2A):419–429
Acknowledgements
We are grateful to the referees for their careful reading with corrections and constructive suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Professor Gerald J. Chang on the occasion of his 60th birthday.
Hung-Lin Fu is supported in part by the National Science Council under grant NSC-97-2115-M009-MY3.
Kuo-Ching Huang is supported in part by the National Science Council under grant NSC-97-2115-M126-004.
Chin-Lin Shiue is supported in part by the National Science Council under grant NSC-97-2115-M033-001.
Rights and permissions
About this article
Cite this article
Fu, HL., Huang, KC. & Shiue, CL. A note on optimal pebbling of hypercubes. J Comb Optim 25, 597–601 (2013). https://doi.org/10.1007/s10878-012-9492-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-012-9492-9