Domination Cover Pebbling: Graph Families

Simple item page
dc.creatorGardner, James
dc.creatorGodbole, Anant P.
dc.creatorTeguia, Alberto Mokak
dc.creatorVuong, Annalies Z.
dc.creatorWatson, Nathaniel
dc.creatorYerger, Carl R.
dc.date2005-07-13
dc.date.accessioned2026-07-07T05:21:40Z
dc.date.available2026-07-07T05:21:40Z
dc.descriptionGiven a configuration of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex, and the placement of one of these on an adjacent vertex. We introduce the notion of domination cover pebbling, obtained by combining graph cover pebbling with the theory of domination in graphs. The domination cover pebbling number, psi(G), of a graph G is the minimum number of pebbles that must be placed on V(G) such that after a sequence of pebbling moves, the set of vertices with pebbles forms a dominating set of G, regardless of the initial configuration of pebbles. We discuss basic results and determine psi(G) for paths, cycles and complete binary trees.
dc.description18 pages
dc.identifierhttps://arxiv.org/abs/math/0507271
dc.identifierhttp://arxiv.org/abs/math/0507271
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75774
dc.subjectCombinatorics
dc.subject05C69; 05C99
dc.titleDomination Cover Pebbling: Graph Families
dc.typetext

Files

Collections

arXiv