Critical Pebbling Numbers of Graphs
Friday, September 29th, 2006
With Dr. Joshua Laison and Erick J. Paul. Submitted to Discrete Math in September of 2004.
Abstract:
If some pebbles are distributed on the vertices of a graph, a pebbling step takes two pebbles from one vertex and replaces one at an adjacent vertex. A distribution D of pebbles is solvable if, starting from D, a [...]