Graphs whose normalized Laplacian has three eigenvalues
  We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eigenvalues. Strongly regular graphs and complete bipartite graphs are examples of such graphs, but we also construct more exotic families of examples from conference graphs, projective planes, and certain quasi-symmetric designs. 
Edwin R. van Dam and Gholamreza Omidi
math.CO