Optimally pebbling hypercubes and powers
暂无分享，去创建一个
Abstract We point out that the optimal pebbling number of the n-cube is ( 4 3 ) n + O ( log n ) , and explain how to approximate the optimal pebbling number of the nth cartesian power of any graph in a similar way.
[1] Fan Chung. Pebbling in hypercubes , 1989 .
[2] Daniel J. Kleitman,et al. An Addition Theorem on the Integers Modulo n , 1989 .
[3] Glenn H. Hurlbert,et al. Pebbling in diameter two graphs and products of paths , 1997, J. Graph Theory.
[4] Lior Pachter,et al. On pebbling graphs , 1995 .
[5] Gérard D. Cohen,et al. A nonconstructive upper bound on covering radius , 1983, IEEE Trans. Inf. Theory.