Cover Pebbling Hypercubes

Simple item page
dc.creatorHurlbert, Glenn H.
dc.creatorMunyan, Benjamin
dc.date2004-09-20
dc.date.accessioned2026-07-07T05:12:22Z
dc.date.available2026-07-07T05:12:22Z
dc.descriptionGiven 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.
dc.description11 pages
dc.identifierhttps://arxiv.org/abs/math/0409368
dc.identifierhttp://arxiv.org/abs/math/0409368
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72551
dc.subjectCombinatorics
dc.subject05C99, 05C35
dc.titleCover Pebbling Hypercubes
dc.typetext

Files

Collections

arXiv