John W. Hagood

Learn More
Place a whole number of pebbles on the vertices of a simple, connected graph G; this is called a pebble distribution. A rubbling move consists of removing a total of two pebbles from some neighbor(s) of a vertex v of G and placing a single pebble on v. A vertex v of G is called reachable from an initial pebble distribution p if there is a sequence of(More)
  • 1