The use of spectral methods in graph theory has allowed for some amazing results where an arithmetic invariant (i.e., diameter, chromatic number, and so on) has been bounded and analyzed using analytic tools. The key has been to examine the spectrum of various matrices associated with graphs and to try to “hear the shape” of the graph from the spectrum. The three most widely used spectrums are ...