Pebbling and optimal pebbling in graphs
โ
David P. Bunde; Erin W. Chambers; Daniel Cranston; Kevin Milans; Douglas B. West
๐
Article
๐
2008
๐
John Wiley and Sons
๐
English
โ 248 KB
## Abstract Given a distribution of pebbles on the vertices of a graph __G__, a __pebbling move__ takes two pebbles from one vertex and puts one on a neighboring vertex. The __pebbling number__ ฮ (__G__) is the least __k__ such that for every distribution of __k__ pebbles and every vertex __r__, a p