Sciweavers

JGT
2006
48views more  JGT 2006»
14 years 17 days ago
Maximum pebbling number of graphs of diameter three
Given a configuration of pebbles on the vertices of a graph G, a pebbling move consists of taking two pebbles off some vertex v and putting one of them back on a vertex adjacent t...
Boris Bukh
JGT
2008
59views more  JGT 2008»
14 years 17 days ago
Pebbling and optimal pebbling in graphs
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 th...
David P. Bunde, Erin W. Chambers, Daniel W. Cranst...