PEBBLING EXPONENTS OF PATHS Kim, Ju-Young; Kim, Sun-Ah;
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. For a connected graph G, (p > 1) is the graph obtained from G by adding the edges (u, v) to G whenever 2 dist(u, v) p in G. And the pebbling exponent of a graph G to be the least power of p such that the pebbling number of is equal to the number of vertices of G. We compute the pebbling number of fourth power of paths so that the pebbling exponents of some paths are calculated.
F.R.K.Chung, Pebbling in hypercubes, SIAM J. Disc. Math. Vol.2, No. 4(1989), pp 467-472.
D. Duffus and I. Rival, Graphs orientalbe as distributive lattices, Proc. Amer. Math. Soc. 88(1983), pp 197-200.
P. Lemke and D. Kleitman, An additional theorem on the intergers modulo n, J. Number Theory 31(1989), pp 335-345.
D. Moews, Pebbling graphs, J. of combinatorial Theory(Series B) 55(1992), pp 224-252.
H.S.Snevily and J. Foster. The 2-pebbling property and a Conjecture of Gra- ham's, preprint.
L. Pachter, H.S.Snevily and B. Voxman, On pebbling graphs, Congr Number, 107(1995), pp 65-80.
Ju Young Kim, Pebbling exponents of graphs, J. of Natural Sciences In Catholic Univ. of Daegu, Vol.2, No. 1(2004), pp 1-7.