• Citations Per Year
Learn More
Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The pebbling number f (G) is the smallest number m such that, for every distribution of m pebbles and every vertex v, a pebble can be moved to v. A graph G is said to have the(More)
Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of taking two pebbles off one vertex, throwing one away, and putting the other pebble on an adjacent vertex. The t-pebbling number πt(G) of a connected graph G is the smallest positive integer such that from every distribution of πt(G) pebbles on G, t(More)
  • 1