Threshold and Complexity Results for the Cover Pebbling Game

Details Threshold and Complexity Results for the Cover Pebbling Game Threshold and Complexity Results for the Cover Pebbling Game

2005-10-18

arxiv.org/abs/math/0510394v1

Mathematics

Combinatorics

23 pages

Scientific paper

Given a configuration of pebbles on the vertices of a graph, a pebbling move is defined by removing two pebbles from some vertex and placing one pebble on an adjacent vertex. The cover pebbling number of a graph is the smallest number of pebbles necessary so that through a sequence of pebbling moves, a pebble can eventually be placed on every vertex simultaneously, no matter how the pebbles are initially distributed. We determine Bose Einstein and Maxwell Boltzmann cover pebbling thresholds for the complete graph. Also, we show that the cover pebbling decision problem is NP-complete.

Affiliated with

Also associated with

No associations

Rating

Threshold and Complexity Results for the Cover Pebbling Game 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 Threshold and Complexity Results for the Cover Pebbling Game, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Threshold and Complexity Results for the Cover Pebbling Game will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-242302