Title of article
Optimally pebbling hypercubes and powers
Author/Authors
David Moews، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
6
From page
271
To page
276
Abstract
We point out that the optimal pebbling number of the n-cube is image, and explain how to approximate the optimal pebbling number of the nth cartesian power of any graph in a similar way.
Journal title
Discrete Mathematics
Serial Year
1998
Journal title
Discrete Mathematics
Record number
951163
Link To Document