I am looking at comparing multiple graph topologies based on their spectra. From the set of all $N\times N$ adjacency matrices, is there any result which points to the adjacency matrix with the highest max eigenvalue and the one with the lowest min eigenvalue?

I know several results which provide closed form expressions for specific well-defined topologies, but have not come across anything which compares spectra across graphs.