Covering Cover Pebbling Number for Jahangir Graph J2, m

Let G be aconected graph. Let p be the number of pebles distributed on the vertices of G. A pebling move is defined by removing two pebles from one vertex and put a peble on an adjacent vertex. The covering cover pebling number, ?(G), is the least p such that after a sequence of pebling moves, the set of vertices hould form acovering for G from every configuration of p pebles on the vertices of G. In this paper, we determine the covering cover pebling number for Jahangir graph J2,m.