2 citations · 2 across the 5 of their papers we have counts for
6 papers · 1 filter
A Proof of the Grundy domination strong product conjecture
Rebekah Herrman, Stephen G. Z. Smith
The Grundy domination number of a simple graph is the length of the longest sequence of unique vertices , , that satisfies the proper…
Extending Grundy domination to -Grundy domination
Rebekah Herrman, Stephen G. Z. Smith
The Grundy domination number of a graph is the length of the longest sequence of unique vertices satisfying $N[v_i] \setminus \cup_{j=1}^{i-1}N…
On the length of L-Grundy sequences
Rebekah Herrman, Stephen G. Z. Smith
An L- sequence of a graph is a sequence of distinct vertices such that . The length of the lo…
Capture times in the Bridge-burning Cops and Robbers game
Rebekah Herrman, Peter van Hintum, Stephen G. Z. Smith
In this paper, we consider a variant of the cops and robbers game on a graph, introduced by Kinnersley and Peterson, in which every time the robber uses an edge, it is removed from…
On a conjecture of Gentner and Rautenbach
António Girão, Gábor Mészáros, Stephen G. Z. Smith
Gentner and Rautenbach conjectured that the size of a minimum zero forcing set in a connected graph on vertices with maximum degree is at most . We disprove…
The poset on connected graphs is Sperner
Stephen G. Z. Smith, István Tomon
Let be the set of all connected graphs on vertex set . Define the partial ordering on as follows: for let if $E(G)\s…