Work

Domination Cover Pebbling: Structural Results

Year: 2005

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.math/0509564

Authors: Watson, Nathaniel G., Yerger, Carl R.

Institutions: University of California, Berkeley, Georgia Institute of Technology

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2152099177

Cites: 11

Cited by: 3

Related to: 10