Pebbling number of squares of odd cycles

A pebbling move on a graph G consists of taking two pebbles off one vertex and placing one pebble on an adjacent vertex. The pebbling number of a connected graph G , denoted by f ( G ) , is the least n such that any distribution of n pebbles on G 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.