PEBBLING NUMBERS OF GRAPH PRODUCTS

  • Kim, Ju Young (DEPARTMENT OF MATHEMATICS CATHOLIC UNIVERSITY OF DAEGU) ;
  • Kim, Sung Sook (DEPARTMENT OF APPLIED MATHEMATICS PAICHAI UNIVERSITY)
  • Received : 2001.05.06
  • Published : 2001.07.18

Abstract

Let G be a connected graph. A pebbling move on a graph G is taking two pebbles off one vertex and placing one of them on an adjacent vertex. The pebbling number of a connected graph G, f(G), is the least n such that any distribution of n pebbles on the vertices of G allows one pebble to be moved to any specified, but arbitrary vertex by a sequence of pebbling moves. In this paper, the pebbling numbers of the lexicographic products of some graphs are computed.

Keywords