Contents

-

The Herscovici’s Conjecture for Cm◻Cn

Ze-Tu Gaot 1
1 Department of Mathematics, College of Information Science and Technology, Hainan University, Haikou 570228, P.R. China.

Abstract

Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The t-pebbling number πt(G) is the smallest positive integer such that for every distribution of πt(G) pebbles and every vertex v, t pebbles can be moved to v. For t=1, Graham conjectured that π1(G◻H)π1(G)π1(H) for any connected graphs G and H, where G◻H denotes the Cartesian product of G and H. Herscovici further conjectured that πst(G◻H)πs(G)πt(H) for any positive integers s and t. Lourdusamy [A. Lourdusamy, “t-pebbling the product of graphs”, Acta Ciencia Indica, XXXII(1)(2006), 171-176] also conjectured that πt(Cm◻Cn)π1(Cm)πt(Cn) for cycles Cm and Cn. In this paper, we show that πst(Cm◻Cn)πs(Cm)πt(Cn), which confirms this conjecture due to Lourdusamy.

Keywords: pebbling number, Graham’s conjecture, Herscovici’s con- jecture.