Improved Pebbling Bounds

Details Improved Pebbling Bounds Improved Pebbling Bounds

2005-10-03

arxiv.org/abs/math/0510045v1

Discrete Mathematics 308, 2301-2306, 2008

Mathematics

Combinatorics

10 pages

Scientific paper

Consider a configuration of pebbles distributed on the vertices of a connected graph of order $n$. A pebbling step consists of removing two pebbles from a given vertex and placing one pebble on an adjacent vertex. A distribution of pebbles on a graph is called solvable if it is possible to place a pebble on any given vertex using a sequence of pebbling steps. The pebbling number of a graph, denoted $f(G)$, is the minimal number of pebbles such that every configuration of $f(G)$ pebbles on $G$ is solvable. We derive several general upper bounds on the pebbling number, improving previous results.

Affiliated with

Also associated with

No associations

Rating

Improved Pebbling Bounds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved Pebbling Bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Pebbling Bounds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-134522