Applying Hurlbert's Linear Optimization Technique to Establish Bounds on Pebbling Numbers

This paper explores the application of Hurlbert's Linear Optimization Technique to determine bounds on pebbling numbers. By applying Hurlbert's weight functions and optimization methods, we derive upper bounds for specific graph families. The study provides a comprehensive analysis of these bounds and contributes to a broader understanding of pebbling numbers in graph theory. In particular, the weight function lemma is applied to calculate upper bounds for graphs such as the Petersen graph, the Bruhat graph, and various trees.