On the Essential Spectrum of Schr\"odinger Operators on Graphs
This work studies geometrical characterizations of the essential spectrum $\sigma_{\text ess}$ of Schrodinger operators on graphs. Especially we focus on generalizing characterizations which are given in terms of the concept of right limits. Intuitively the set of right limits of a Schrodinger operator $H$ on $\ell^2(\mathbb{N})$ includes the limit operators which are obtained by a sequence of left-shifts (moving away to infinity) of $H$. One characterization, which is known for such operators is that $\sigma_{\text ess}(H)$ is equal to the union over the spectra of right limits of $H$. Additionally, the essential spectrum equals to the union over the sets of "eigenvalues" corresponding to bounded eigenfunctions of the right limits of $H$. The first characterization above (and its generalization to $\mathbb{Z}^n$) is essentially due to a work by Last-Simon from 2006. In this work we study the possibility of generalizing these characterizations of $\sigma_{ess}(H)$ to Schrodinger operators on graphs. The work is composed of the following chapters: 
Chapter 1. An overview, including the setting and the proposed generalization of the concept of right limits to general graphs. 
Chapter 2. On extending the original Last-Simon argument for the proof of the first characterization to graphs. We give both a partial positive result and an example of a graph on which this characterization fails. 
Chapter 3. A Focus on characterizing the essential spectrum on trees. 
Chapter 4. A study of the possible generalization of the second characterization to graphs, from which we also get the first characterization on a general family of graphs.