PEBBLING NUMBERS OF THE COMPOSITIONS OFTWO GRAPHS
Journal of the Korean Society of Mathematical Education Series B: The Pure and Applied Mathematics / Journal of the Korean Society of Mathematical Education Series B: The Pure and Applied Mathematics, (P)1226-0657; (E)2287-6081
2002, v.9 no.1, pp.57-61
Kim, Ju-Young
Kim, Sung-Sook
Kim,,
J.
, &
Kim,,
S.
(2002). PEBBLING NUMBERS OF THE COMPOSITIONS OFTWO GRAPHS. Journal of the Korean Society of Mathematical Education Series B: The Pure and Applied Mathematics, 9(1), 57-61.
Abstract
Let G be a connected graph. A pebbling move on a graph G is the movement of taking two pebbles off from a vertex and placing one of them onto an adjacent vertex. The pebbling number f(G) of a connected graph 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 compositions of two graphs are computed.
- keywords
-
pebbling,
composition product