Pebbling number of squares of odd cycles

A pebbling move on a graph GG consists of taking two pebbles off one vertex and placing one pebble on an adjacent vertex. The pebbling number of a connected graph GG, denoted by f(G)f(G), is the least nn such that any distribution of nn pebbles on GG allows one pebble to be moved to any specified vertex by a sequence of pebbling moves. This paper determines the pebbling numbers of squares of odd cycles.