# A graph pebbling algorithm on weighted graphs

Research output: Contribution to journalArticle

7 Citations (Scopus)

### Abstract

A pebbling move on a weighted graph removes some pebbles at a vertex and adds one pebble at an adjacent vertex. The number of pebbles removed is the weight of the edge connecting the vertices. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using pebbling moves. The pebbling number of a weighted graph is the smallest number m needed to guarantee that any vertex is reachable from any pebble distribution of m pebbles. Regular pebbling problems on unweighted graphs are special cases when the weight on every edge is 2. A regular pebbling problem often simplifies to a pebbling problem on a simpler weighted graph. We present an algorithm to find the pebbling number of weighted graphs. We use this algorithm together with graph simplifications to find the regular pebbling number of all connected graphs with at most nine vertices.

Original language English (US) 221-244 24 Journal of Graph Algorithms and Applications 14 2 https://doi.org/10.7155/jgaa.00205 Published - 2010

### Fingerprint

Graph Algorithms
Weighted Graph
Vertex of a graph
Graph in graph theory
Simple Graph
Simplification
Connected graph
Simplify

### ASJC Scopus subject areas

• Theoretical Computer Science
• Computer Science(all)
• Geometry and Topology
• Computer Science Applications
• Computational Theory and Mathematics

### Cite this

In: Journal of Graph Algorithms and Applications, Vol. 14, No. 2, 2010, p. 221-244.

Research output: Contribution to journalArticle

title = "A graph pebbling algorithm on weighted graphs",
abstract = "A pebbling move on a weighted graph removes some pebbles at a vertex and adds one pebble at an adjacent vertex. The number of pebbles removed is the weight of the edge connecting the vertices. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using pebbling moves. The pebbling number of a weighted graph is the smallest number m needed to guarantee that any vertex is reachable from any pebble distribution of m pebbles. Regular pebbling problems on unweighted graphs are special cases when the weight on every edge is 2. A regular pebbling problem often simplifies to a pebbling problem on a simpler weighted graph. We present an algorithm to find the pebbling number of weighted graphs. We use this algorithm together with graph simplifications to find the regular pebbling number of all connected graphs with at most nine vertices.",
author = "Nandor Sieben",
year = "2010",
doi = "10.7155/jgaa.00205",
language = "English (US)",
volume = "14",
pages = "221--244",
journal = "Journal of Graph Algorithms and Applications",
issn = "1526-1719",
publisher = "Brown University",
number = "2",

}

TY - JOUR

T1 - A graph pebbling algorithm on weighted graphs

AU - Sieben, Nandor

PY - 2010

Y1 - 2010

N2 - A pebbling move on a weighted graph removes some pebbles at a vertex and adds one pebble at an adjacent vertex. The number of pebbles removed is the weight of the edge connecting the vertices. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using pebbling moves. The pebbling number of a weighted graph is the smallest number m needed to guarantee that any vertex is reachable from any pebble distribution of m pebbles. Regular pebbling problems on unweighted graphs are special cases when the weight on every edge is 2. A regular pebbling problem often simplifies to a pebbling problem on a simpler weighted graph. We present an algorithm to find the pebbling number of weighted graphs. We use this algorithm together with graph simplifications to find the regular pebbling number of all connected graphs with at most nine vertices.

AB - A pebbling move on a weighted graph removes some pebbles at a vertex and adds one pebble at an adjacent vertex. The number of pebbles removed is the weight of the edge connecting the vertices. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using pebbling moves. The pebbling number of a weighted graph is the smallest number m needed to guarantee that any vertex is reachable from any pebble distribution of m pebbles. Regular pebbling problems on unweighted graphs are special cases when the weight on every edge is 2. A regular pebbling problem often simplifies to a pebbling problem on a simpler weighted graph. We present an algorithm to find the pebbling number of weighted graphs. We use this algorithm together with graph simplifications to find the regular pebbling number of all connected graphs with at most nine vertices.

UR - http://www.scopus.com/inward/record.url?scp=80051536949&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051536949&partnerID=8YFLogxK

U2 - 10.7155/jgaa.00205

DO - 10.7155/jgaa.00205

M3 - Article

AN - SCOPUS:80051536949

VL - 14

SP - 221

EP - 244

JO - Journal of Graph Algorithms and Applications

JF - Journal of Graph Algorithms and Applications

SN - 1526-1719

IS - 2

ER -