TY - JOUR AU - Lourdusamy, A. AU - Steffi, J. Jenifer PY - 2019/08/14 Y2 - 2024/03/28 TI - Pebbling on zig-zag chain graph of n odd cycles JF - Proyecciones (Antofagasta, On line) JA - Proyecciones (Antofagasta, On line) VL - 38 IS - 3 SE - DO - 10.22199/issn.0717-6279-2019-03-0038 UR - https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3710 SP - 597-615 AB - 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. ER -