Pebbling on Crisscross Sequence of m Complete Graphs

Abstract

This paper investigates the pebbling number, the two pebbling property, the t-pebbling number, and the 2t-pebbling property of a crisscross sequence comprised of m complete graphs. By analyzing these pebbling properties, we aim to gain insights into the efficiency and feasibility of pebbling operations within this specific graph structure.