11 citations · 25 across the 3 of their papers we have counts for
3 papers
math.CO2005★ 3 cited
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…
math.CO2005★ 11 cited
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…
math.CO2005★ 11 cited
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…