Generalised Pebbling Numbers of Some Graphs

The generalized pebbling number of a graph G, fgl(G), is the least positive integer n such that however n 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 wheel Wn, fan Fn and complete r-partite graph.