CHUNGCHEONG MATHEMATICAL SOCIETY Volume 19, No. 4, December 2006 THE DOMINATION COVER PEBBLING NUMBER OF SOME GRAPHS

Abstract

A pebbling move on a connected graph G is taking two pebbles off of one vertex and placing one of them on an adjacent vertex. The domination cover pebbling number ψ(G) is the minimum number of pebbles required so that any initial configuration of pebbles can be transformed by a sequence of pebbling moves so that the set of vertices that contain pebbles forms a domination set of G. We determine the domination cover pebbling number for fans, fuses, and pseudo-star.

This article was migrated from the previous system via automation. The abstract may not be written correctly. Please view the PDF file.