On Pebbling Jahangir Graph

Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move (or pebbling step) is defined as the removal of two pebbles off a vertex and placing one on an adjacent vertex. The pebbling number, f(G), of a graph G is the least number m such that, however m pebbles are placed on the vertices of G, we can move a pebble to any vertex by a sequence of pebbling moves. In this paper, we determine f(G) for Jahangir graph J2,m (m ≥ 8).