Pebbling on Graph Products and other Binary Graph Constructions
Abstract
Pebbling on graphs is a two-player game which involves repeatedly moving a pebble from one vertex to another by removing another pebble from the first vertex. The pebbling number π(G) is the least number of pebbles required so that, regardless of the initial configuration of pebbles, a pebble can reach any vertex. Graham conjectured that the pebbling number for the cartesian product, G 1mm1mm H, is bounded above by π(G) π(H). We show that π(G1mm1mm H) 2π(G) π(H) and, more sharply, that π(G 1mm1mm H) (π(G)+|G|) π(H). Furthermore, we provide similar results for other graph products and graph operations.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.