Domination Cover Pebbling: Structural Results
Nathaniel G. Watson, Carl R. Yerger
TL;DR
This paper advances the understanding of domination cover pebbling by providing bounds for graphs with specific diameters, introducing a new variant called subversion DCP, and discussing preliminary findings.
Contribution
It offers new bounds for the DCP number based on graph diameter and introduces the subversion DCP variant with initial results.
Findings
Bound for DCP number for graphs with specified diameter
Ratio bounds between cover pebbling number and DCP number for diameter two graphs
Introduction and preliminary discussion of subversion DCP
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs