Pebbling And Cover Pebbling Numbers Of Graphs

Abstract

Cover pebbling is a method in graph theory that was first brought about by Largias and Saks. This topic in graph theory was used to come up with a way to calculate how much of a consumable resource would being needed to begin transportation of said consumable resource. This paper will tackle the basics on cover pebbling, brush upon weight pebbling, and problem 9 of the open problems that can be found in Betsy Crull's paper The cover pebbling number of graphs. Problem 9: What are the cover pebbling number for other graphs G, for example cubes, complete r-partite graphs, etc.