We present a graph spectral approach in which melodies are represented as graphs, based on the intervals between the notes they are composed of. These graphs are then indexed into a database using their laplacian spectra as a feature vector. This laplacian spectrum is a good representative of the original melody. Consequently, range searching around the query spectrum returns similar melodies.