The pebbling number of the square of an odd cycle

In graph pebbling games, one considers a distribution of pebbles on the vertices of a graph, and a pebbling move consists of taking two pebbles off one vertex and placing one on adjacent vertex. The pebbling number, f(G), of a graph G is the smallest m such that for every initial distribution of m pebbles on V(G) and every target vertex x, there exists a sequence of pebbling moves leading to a distribution with at least one pebble at x. In this paper, we determine the pebbling number of the square of an odd cycle.