Cover pebbling numbers and bounds for certain families of graphs

Simple item page
dc.creatorWatson, Nathaniel G.
dc.creatorYerger, Carl R.
dc.date2004-09-18
dc.date.accessioned2026-07-07T05:12:17Z
dc.date.available2026-07-07T05:12:17Z
dc.descriptionGiven 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, gamma(G), is the smallest number of pebbles such 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. The cover pebbling number for complete multipartite graphs and wheel graphs is determined. We also prove a sharp bound for gamma(G) given the diameter and number of vertices of G.
dc.description10 pages, 1 figure, submitted to Discrete Mathematics
dc.identifierhttps://arxiv.org/abs/math/0409321
dc.identifierhttp://arxiv.org/abs/math/0409321
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72521
dc.subjectCombinatorics
dc.subject05C35, 05C99
dc.titleCover pebbling numbers and bounds for certain families of graphs
dc.typetext

Files

Collections

arXiv