Sciencia Acta Xaveriana

19-27

Authors: A. Lourdusamy, C. Muthulakshmi @ Sasikala and T. Mathivanan

A pebbling move is defined by removing two pebbles from some vertex and placing one pebble on an adjacent vertex. A graph is said to be cover pebbled if every vertex has a pebble on it after a sequence of pebbling moves. The maximum independent set cover pebbling number, ρ(G), of a graph G is the minimum number of pebbles that are placed on V(G) such that after a sequence of pebbling moves, the set of vertices with pebbles forms a maximum independent set of G, regardless of their initial configuration. In this paper, we determine the maximum independent set cover pebbling number of complete graph and paths.