• COVER PEBBLING NUMBER FOR CUBE OF A PATH

Abstract

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 cover pebbling number of a graph, is the least positive integer m such that however the m pebbles are placed on the vertices of G, we can eventually put a pebble on every vertex. In this paper we compute the cover pebbling number of the cube of a path.