The domination cover pebbling number of the square of a path

Given a configuration of pebbles on the vertices of a connected graph g,a pebbling move (or pebbling step) is defined as the removal of two pebbles from a vertex and placing one pebble on an adjacent vertex. the domination cover pebbling number,ψ (g),of a graph g is the minimum number of pebbles that have to be placed on v (g) such that after a sequence of pebbling moves,the set of vertices with pebbles forms a dominating set of g,regardless of the initial configuration. in this paper,we determine the domination cover pebbling number for the square of a path.