한국수학교육학회지시리즈B:순수및응용수학 (The Pure and Applied Mathematics)
- 제9권1호
- /
- Pages.57-61
- /
- 2002
- /
- 1226-0657(pISSN)
- /
- 2287-6081(eISSN)
PEBBLING NUMBERS OF THE COMPOSITIONS OF TWO GRAPHS
- Kim, Ju-Young (Department of Mathematics, Catholic University) ;
- Kim, Sung-Sook (Department of Applied Mathematics, Paichai University)
- Published : 2002.05.01
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.