activity
20042014
most citedCover pebbling numbers and bounds for certain families of graphs

13 citations · 42 across the 7 of their papers we have counts for

collaborators

7 papers

math.CT2014★ 3 cited

Non-Simplicial Nerves for Two-Dimensional Categorical Structures

Nathaniel Watson

The most natural notion of a simplicial nerve for a (weak) bicategory was given by Duskin, who showed that a simplicial set is isomorphic to the nerve of a -category (i.e. a…

math.AC2009

Semilocal formal fibers of principal prime ideals

John Chatlos, Brian Simanek, Nathaniel G. Watson +1

Let (T,m) be a complete local (Notherian) ring, C a finite set of pairwise incomparable nonmaximal prime ideals of T, and p a nonzero element. We provide necessary and sufficient c…

math.CO2005★ 1 cited

Threshold and Complexity Results for the Cover Pebbling Game

Anant P. Godbole, 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…

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…