Speaker: Rodney Keaton, Assistant Professor of Mathematics, East Tennessee State University
Title: Stacking Results in Graph Rubbling
Abstract: Graph pebbling was first presented as a technique for solving an elementary number theory problem by Lagarias and Saks. This resulted in a 1989 paper of Chung, where the notion of graph pebbling was formalized and used to solve the previously mentioned problem. A variant of graph pebbling, known as graph rubbling, was first introduced in 2009 by Belford and Sieben. In this talk we provide an introduction to graph pebbling and graph rubbling. Then, we will present several recent results in this area which make connections between graph rubbling, stacking, and graph domination.