The t-pebbling number of Lamp graphs.

• Lourdusamy, A. ^[1] ; Patrick, F. ^[1] ; Mathivanan, T. ^[1]
  1. [1] St. Xavier’s College (Autonomous).
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 37, Nº. 3, 2018, págs. 503-517
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • 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.