THE DOMINATION COVER PEBBLING NUMBER OF SOME GRAPHS

  • Kim, Ju Young (Department of Mathematics Catholic University of Daegu) ;
  • Kim, Sung Sook (Department of Applied Mathematics Paichai University)
  • 투고 : 2006.11.23
  • 발행 : 2006.12.31

초록

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 ${\psi}(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.

키워드