The 2t-Pebbling Property on the Jahangir Graph J_2, m

The t-pebbling number, f_t(G), of a connected graph G, is the smallest positive integer such that from every placement of f_t(G) pebbles, t pebbles can be moved to any specified target vertex by a sequence of pebbling moves, each move taking two pebbles off a vertex and placing one on an adjacent vertex. A graph G satisfies the 2t-pebbling property if 2t pebbles can be moved to a specified vertex when the total starting number of pebbles is 2f_t(G)-q +1 where q is the number of vertices with at least one pebble. In this paper, we are going to show that the graph J_2, m (m \geq 3) satisfies the 2t-pebbling property.