Maximum Independent set cover pebbling number of a Binary tree

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 series of pebbling moves. The maximum independent set cover pebbling number of a graph G is the minimum number, ?(G), of pebbles required so that any initial configuration of ?(G) pebbles can be transformed by a sequence of pebbling moves so that after the pebbling moves the set of vertices that contains pebbles form a maximum independent set S of G. In this paper, we determine the maximum independent set cover pebbling number of a binary tree.