Optimally pebbling hypercubes and powers

  title={Optimally pebbling hypercubes and powers},
  author={David Moews},
  journal={Discrete Mathematics},
We point out that the optimal pebbling number of the n-cube is (4),+o~log,), and explain how to approximate the optimal pebbling number of the nth cartesian power of any graph in a similar way. (~) 1998 Elsevier Science B.V. All rights reserved Let G be a graph. By a distribution of pebbles on G we mean a function a : V(G) Z>~0; we usually write a(v) as a~, and call a~ the number of pebbles on v. A pebbling move on a distribution changes the distribution by removing 2 pebbles from some vertex… CONTINUE READING