Graph pebbling is a network optimization model for transporting discrete resources that are consumed in transit: the movement of 2 pebbles across an edge consumes one of the pebbles. The pebbling number of a graph is the fewest number of pebbles t so that, from any initial configuration of t pebbles on its vertices, one can place a pebble on any given target vertex via such pebbling steps.
Download count: 0
- Digital object identifier: 10.1137/130914607
- Identifier TypeInternational standard serial numberIdentifier Value1095-7146
- Identifier TypeInternational standard serial numberIdentifier Value0895-4801
Citation and reuse
Cite this item
This is a suggested citation. Consult the appropriate style guide for specific citation guidelines.
Alcon, Liliana, Gutierrez, Marisa, & Hurlbert, Glenn (2014). PEBBLING IN SPLIT GRAPHS. SIAM JOURNAL ON DISCRETE MATHEMATICS, 28(3), 1449-1466. http://dx.doi.org/10.1137/130914607