The Cover Pebbling Number of Graphs

Simple item page
dc.creatorCrull, Betsy
dc.creatorCundiff, Tammy
dc.creatorFeltman, Paul
dc.creatorHurlbert, Glenn
dc.creatorPudwell, Lara
dc.creatorSzaniszlo, Zsuzsanna
dc.creatorTuza, Zsolt
dc.date2004-06-09
dc.date.accessioned2026-07-07T05:09:08Z
dc.date.available2026-07-07T05:09:08Z
dc.descriptionA pebbling move on a graph consists of taking two pebbles off of one vertex and placing one pebble on an adjacent vertex. In the traditional pebbling problem we try to reach a specified vertex of the graph by a sequence of pebbling moves. In this paper we investigate the case when every vertex of the graph must end up with at least one pebble after a series of pebbling moves. The cover pebbling number of a graph is the minimum number of pebbles such that however the pebbles are initially placed on the vertices of the graph we can eventually put a pebble on every vertex simultaneously. We find the cover pebbling numbers of trees and some other graphs. We also consider the more general problem where (possibly different) given numbers of pebbles are required for the vertices.
dc.description12 pages. Submitted to Discrete Mathematics
dc.identifierhttps://arxiv.org/abs/math/0406206
dc.identifierhttp://arxiv.org/abs/math/0406206
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71519
dc.subjectCombinatorics
dc.subject05C99, 05C35, 05C05
dc.titleThe Cover Pebbling Number of Graphs
dc.typetext

Files

Collections

arXiv