Mathematics – Combinatorics
Scientific paper
2004-09-20
Mathematics
Combinatorics
11 pages
Scientific paper
Given a graph G and a configuration C of pebbles on the vertices of G, a pebbling step removes two pebbles from one vertex and places one pebble on an adjacent vertex. The cover pebbling number g=g(G) is the minimum number so that every configuration of g pebbles has the property that, after some sequence of pebbling steps, every vertex has a pebble on it. We prove that the cover pebbling number of the d-dimensional hypercube Q^d equals 3^d.
Hurlbert Glenn H.
Munyan Benjamin
No associations
LandOfFree
Cover Pebbling Hypercubes 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 Cover Pebbling Hypercubes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cover Pebbling Hypercubes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-327854