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 pebble can be moved to any specified vertex by a sequence of pebbling steps. The pebbling number p(G) of a connected graph is the smallest number of pebbles such that every distribution with p(G) pebbles is solvable. If we restrict our attention to distributions which are minimally solvable or maximally unsolvable, we obtain three additional pebbling parameters on G, the r-, g-, and u-critical pebbling numbers of a connected graph. We investigate properties of the r-critical pebbling number and its relationship to the pebbling number.
Download the PDF
Welcome!
I am a graduate student at the University of Nebraska-Lincoln specializing in Commutative Algebra under Roger Wiegand. I attended The Colorado College as an undergraduate, where I earned my BA in Mathematics with Distinction. After graduation, I spent a year working in The Colorado College Mathematics and Computer Science department as a paraprofessional.
Some things about me that you won’t find in my CV include my passion for yoga and good vegan food, my love of animals (especially cats), and my extreme enthusiasm for terrible jokes. I love to hike, bike, camp, cook, read, and play board games with my husband.