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