The T-Pebbling Number Of Jahangir Graph
A. Lourdusamy, S. Samuel Jeyaseelan, T. Mathivanan · viXra · 2012
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 from a vertex and placing one pebble on an adjacent vertex. The t-pebbling number, ft(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 t pebbles to any vertex by a sequence of pebbling moves.