학술저널
PEBBLING NUMBERS OF GRAPH PRODUCTS
- 충청수학회
- Journal of the Chungcheong Mathematical Society
- Volume 14, No. 1
-
2001.027 - 14 (8 pages)
- 0
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.
1. Introduction
2. Lexicographic Product
3. Pebbling G * H with diameter( G) = 2.
(0)
(0)