Domination Cover Pebbling: Structural Results

Abstract

This paper continues the results of “Domination Cover Pebbling: Graph Families.” An almost sharp bound for the domination cover pebbling (DCP) number, $\psi (G)$, for graphs $G$ with specified diameter has been computed. For graphs of diameter two, a bound for the ratio between $\lambda (G)$, the cover pebbling number of $G$, and $\psi (G)$ has been computed. A variant of domination cover pebbling, called subversion DCP, is introduced, and preliminary results are discussed.