Answering a question of Jiang and Polyanskii as well as Jiang, Tidor, Yao, Zhang, and Zhao, we show the existence of infinitely many angles $θ$ for which the maximum number of lines in $\mathbb R^n$ meeting at the origin with pairwise angles $θ$ exceeds $n+Ω(\log\log n)$ but is at most $n+o(n)$. To accomplish this, we construct, for various real $λ$ and integer $d$, $d$-regular graphs with second eigenvalue exactly $λ$ and arbitrarily large second eigenvalue multiplicity. Central to our construction is a distribution on factors of bipartite graphs which possesses concentration properties.