Geodesic
A Graph Pebbling Algorithm on Weighted Graphs
Journal of Graph Algorithms and Applications, Tome 14 (2010) no. 2, pp. 221-244.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

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.
DOI : 10.7155/jgaa.00205
Keywords: weighted graph pebbling 
@article{JGAA_2010_14_2_a4,
     author = {Nandor Sieben},
     title = {A {Graph} {Pebbling} {Algorithm} on {Weighted} {Graphs}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {221--244},
     publisher = {mathdoc},
     volume = {14},
     number = {2},
     year = {2010},
     doi = {10.7155/jgaa.00205},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00205/}
}
TY  - JOUR
AU  - Nandor Sieben
TI  - A Graph Pebbling Algorithm on Weighted Graphs
JO  - Journal of Graph Algorithms and Applications
PY  - 2010
SP  - 221
EP  - 244
VL  - 14
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00205/
DO  - 10.7155/jgaa.00205
LA  - en
ID  - JGAA_2010_14_2_a4
ER  - 
%0 Journal Article
%A Nandor Sieben
%T A Graph Pebbling Algorithm on Weighted Graphs
%J Journal of Graph Algorithms and Applications
%D 2010
%P 221-244
%V 14
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00205/
%R 10.7155/jgaa.00205
%G en
%F JGAA_2010_14_2_a4
Nandor Sieben. A Graph Pebbling Algorithm on Weighted Graphs. Journal of Graph Algorithms and Applications, Tome 14 (2010) no. 2, pp. 221-244. doi : 10.7155/jgaa.00205. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00205/

Cité par Sources :