• Title/Summary/Keyword: 2t-pebbling property

Search Result 1, Processing Time 0.015 seconds

PEBBLING ON THE MIDDLE GRAPH OF A COMPLETE BINARY TREE

  • LOURDUSAMY, A.;NELLAINAYAKI, S. SARATHA;STEFFI, J. JENIFER
    • Journal of applied mathematics & informatics
    • /
    • v.37 no.3_4
    • /
    • pp.163-176
    • /
    • 2019
  • Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex and the placement of one of those pebbles at an adjacent vertex. The t-pebbling number, $f_t(G)$, of a connected graph G, is the smallest positive integer such that from every placement of $f_t(G)$ pebbles, t pebbles can be moved to any specified vertex by a sequence of pebbling moves. A graph G has the 2t-pebbling property if for any distribution with more than $2f_t(G)$ - q pebbles, where q is the number of vertices with at least one pebble, it is possible, using the sequence of pebbling moves, to put 2t pebbles on any vertex. In this paper, we determine the t-pebbling number for the middle graph of a complete binary tree $M(B_h)$ and we show that the middle graph of a complete binary tree $M(B_h)$ satisfies the 2t-pebbling property.