Main Article Content

Abstract

Let be a connected simple graph with vertex set and a distribution of pebbles on the vertices of V. The covering cover rubbling number of pebbles is the smallest number  such that after a sequence of pebbling and rubbling moves, the set of vertices should form a covering of , from any initial configuration of p pebbles. We determine the covering cover rubbling number of several common graph families.

Article Details