For a connected graph G with a distribution of p pebbles on it, a pebbling move involves the removal of two pebbles from a vertex and an addition of one pebble to an adjacent vertex. The cover pebbling number γ(G) is the minimum number of pebbles required to place one pebble on each vertex of the graph G after a sequence of pebbling moves, regardless of the initial configuration of the pebbles. It is known that the problem of computing the cover pebbling number is NP-complete [7]. In this paper we compute the cover pebbling number of Comb, Friendship and Helm graphs.