Learn More
learned many things in the last several years that have helped me in several areas of this thesis. Along with the faculty, I would like to thank the office staff who do much in the department that is unseen, and have certainly done much for me personally. I would also like to thank Phil Romig for teaching me too many things to mention. Also, I would like to(More)
Given a simple, connected graph, a pebbling configuration is a function from its vertex set to the nonnegative integers. A pebbling move between adjacent vertices removes two pebbles from one vertex and adds one pebble to the other. A vertex r is said to be reachable from a configuration if there exists a sequence of pebbling moves that places one pebble on(More)
  • 1