Domination Cover Pebbling: Structural Results

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
15 pages

Keywords

Combinatorics, 05C69; 05C99

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/94879

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0509564
 http://arxiv.org/abs/math/0509564

Collections

arXiv