Let $G= (V,E)$ be a finite, undirected and unweighted graph with $V = \{v_1,\ldots, v_n\}$. Denote by $d_i$ the degree of $v_i$, i.e. the number of vertices that are adjacent to $v_i$. Let $A$ be the adjacency matrix of $G$ and $D = diag(d_1, \ldots d_n)$. Then the Laplacian of $G$ is defined to be $$L = D - A$$ and the normalized Laplacian $$\Delta = I - D^{-1}A$$ (I assume that $d_i \neq 0$ for all $i$). Denote by $\lambda_0 \leq \lambda_1 \leq \ldots \leq \lambda_{n-1}$ the eigenvalues of $\Delta$. Then $\lambda_0 = 0$ and $\lambda_{n-1} \leq 2$.
Most results in spectral graph theory focus on $\lambda_1$ and $\lambda_{n-1}$ as they determine global properties of $G$ very nicely. I'm also familiar with some results that show a connection between $\lambda_k$ and how hard it is to partition $G$ into $k+1$ subgraphs.
However, looking at some examples it seems to me that there should be some characterization of when $\Delta$ has EV $1$. I believe that this is connected to the occurrence of special subgraphs but I'm having a hard time finding papers/literature that deal with that topic. So my question is: Are there papers dealing with characterizing non-extremal eigenvalues of $\Delta$ and especially $\lambda = 1$?