Domination Cover Pebbling: Structural Results

Simple item page
dc.creatorWatson, Nathaniel G.
dc.creatorYerger, Carl R.
dc.date2005-09-23
dc.date.accessioned2026-07-07T06:18:51Z
dc.date.available2026-07-07T06:18:51Z
dc.descriptionThis paper continues the results of "Domination Cover Pebbling: Graph Families." An almost sharp bound for the domination cover pebbling (DCP) number for graphs G with specified diameter has been computed. For graphs of diameter two, a bound for the ratio between the cover pebbling number of G and the DCP number of G has been computed. A variant of domination cover pebbling, called subversion DCP is introducted, and preliminary results are discussed.
dc.description15 pages
dc.identifierhttps://arxiv.org/abs/math/0509564
dc.identifierhttp://arxiv.org/abs/math/0509564
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/94879
dc.subjectCombinatorics
dc.subject05C69; 05C99
dc.titleDomination Cover Pebbling: Structural Results
dc.typetext

Files

Collections

arXiv