Resumen de The t-pebbling number of Lamp graphs.

A. Lourdusamy, F. Patrick, T. Mathivanan

• Let G be a graph and some pebbles are distributed on its vertices. A pebbling move (step) consists of removing two pebbles from one vertex, throwing one pebble away, and moving the other pebble to an adjacent vertex. The t-pebbling number of a graph G is the least integer m such that from any distribution of m pebbles on the vertices of G, we can move t pebbles to any specified vertex by a sequence of pebbling moves.

  In this paper, we determine the t-pebbling number of Lamp graphs.