论文部分内容阅读
Chung defined a pebbling move on a graph G as the removal of two pebbles from one vertex and the addition of one pebble to an adjacent vertex. The pebbling number of a connected graph G, f(G), is the least n such that any distribution of n pebbles on G al