Domination Cover Pebbling: Structural Results
Combinatorics
2007-05-23 v1
Abstract
This 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.
Keywords
Cite
@article{arxiv.math/0509564,
title = {Domination Cover Pebbling: Structural Results},
author = {Nathaniel G. Watson and Carl R. Yerger},
journal= {arXiv preprint arXiv:math/0509564},
year = {2007}
}
Comments
15 pages