Pebbling on zig-zag chain graph of n odd cycles

• Lourdusamy, A. ^[1] ; Steffi, J. Jenifer ^[1]
  1. [1] St. Xavier’s College (Autonomous).
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 38, Nº. 3, 2019, págs. 597-615
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The pebbling number of G, f (G), is the least n such that any distribution of n pebbles on G allows one pebble to be reached to any specified, but an arbitrary vertex. Similarly, the t−pebbling number of G, ft(G), is the least m such that from any distribution of m pebbles, we can move t pebbles to any specified, but an arbitrary vertex. In this paper, we determine the pebbling number, and the t−pebbling number of the zigzag chain graph of n copies of odd cycles.