The -pebbling number of a graph is the least positive integer such that however these pebbles are placed on the vertices of , we can move pebbles to any vertex by a sequence of moves, each move taking two pebbles off one vertex and placing one on an adjacent vertex. In this paper, we study the generalized Graham’s pebbling conjecture for the product of graphs when is a complete -partite graph and has a -pebbling property.