A pebbling move is defined as the removal of two pebbles from any vertex and placing one on the adjacent vertex under a given configuration of pebbles on the vertices of a connected graph G. In this paper, we introduce a new graph invariant called the secure domination cover pebbling number which is a combination of cover pebbling and secure domination. The secure domination cover pebbling number,  of a graph G is the minimum number of pebbles that must be placed on such that after a sequence of pebbling moves, the set of vertices with pebbles forms a secure dominating set regardless of the initial configuration. Also, we find the secure domination cover pebbling number for the complete graph  the complete bipartite graph  and the complete r-partite graph

graph pebbling, secure domination, cover pebbling number, secure domination cover pebbling number.