Generalizedt-pebbling number of a graph
A. Lourdusamy, C. Muthulakshmi · Journal of Discrete Mathematical Sciences and Cryptography · 2009
The generalized pebbling number fgl (G) of a graph G is the least positive integer t such that however these t pebbles are placed on the vertices of G, we can move a pebble to any vertex, by a sequence of moves, each move taking p pebbles off one vertex and placing one on an adjacent vertex. In this paper, we determine the generalized pebbling number of a tree T and a hypercube Qn . In Section 3, we determine the generalized t-pebbling number of a complete graph, n-star, cycle, path, tree and cube.