On the pebbling number of [formula omitted] in case of even parity

Abstract

The subject of this article is the calculation of the pebbling number p of the Cartesian product Cm×Cn of two cycle graphs for m, n both even and both odd. This can be done from Chung (1992) using weight functions that induce a total order on the corresponding graphs. This article can be seen as a generalization of Herscovici and Higgins (1998) using methods and results of Herscovici (2003), Moews (1992) and Snevily and Foster (2000).