Graph pebbling is a network model for studying whether or not a given supply of discrete
pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge …

Graph pebbling is a network model for transporting discrete resources that are consumed in
transit. Deciding whether a given configuration on a particular graph can reach a specified …

Graph Pebbling: A Blend of Graph Theory, Number Theory, and Optimization Page 1 Graph
Pebbling: A Blend of Graph Theory, Number Theory, and Optimization Glenn Hurlbert and …

Graph pebbling is a network model for transporting discrete resources that are consumed in
transit. Deciding whether a given configuration on a particular graph can reach a specified …

Given a simple, connected graph, a pebbling configuration (or just configuration) is a
function from its vertex set to the nonnegative integers. A pebbling move between adjacent …

We define three new pebbling parameters of a connected graph $ G $, the $ r $-, $ g $-, and
$ u $-critical pebbling numbers. Together with the pebbling number, the optimal pebbling …

Pebbling can be viewed as a model of resource transportation for networks. We use a graph
to denote the network. A pebbling move on a graph consists of the removal of two pebbles …

A pebbling move on a graph consists of taking two pebbles off from one vertex and add one
pebble on an adjacent vertex, the $ t $-pebbling number of a graph $ G $ is the minimum …

The pebbling number of a graph $ G $, $ f (G) $, is the least $ p $ such that, however $ p $
pebbles are placed on the vertices of $ G $, we can move a pebble to any vertex by a …

Graph pebbling is a network model for transporting discrete resources that are consumed in
transit. Deciding whether a given configuration on a particular graph can reach a specified …