13 citations · 38 across the 4 of their papers we have counts for
4 papers · 1 filter
Domination Cover Pebbling: Structural Results
Nathaniel G. Watson, Carl R. Yerger
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 di…
Domination Cover Pebbling: Graph Families
James Gardner, Anant P. Godbole, Alberto Mokak Teguia +3
Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex, and the placement of one of thes…
The Complexity of Pebbling and Cover Pebbling
Nathaniel G. Watson
This paper discusses the complexity of graph pebbling, dealing with both traditional pebbling and the recently introduced game of cover pebbling. Determining whether a configuratio…
Cover pebbling numbers and bounds for certain families of graphs
Nathaniel G. Watson, Carl R. Yerger
Given a configuration of pebbles on the vertices of a graph, a pebbling move is defined by removing two pebbles from some vertex and placing one pebble on an adjacent vertex. The c…