An L- sequence of a graph $G $ is a sequence of distinct vertices $S = \{v_1, ... , v_k\}$ such that $N[v_i] \setminus \cup_{j=1}^{i-1} N(v_j) \neq \emptyset$. The length of the longest L-sequence is called the L-Grundy domination number, denoted $γ_{gr}^L(G)$. In this paper, we prove $γ_{gr}^L(G) \leq n(G) - δ(G) + 1$, which was conjectured by Bre{š}ar, Gologranc, Henning, and Kos. We also prove some early results about characteristics of $n$-vertex graphs such $γ_{gr}^L(G) = n$, as well as bounds on the change in L-Grundy number under graph operations.