The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In the paper A Spectral Graph Uncertainty Principle, we investigate a spectral graph analogy to Heisenberg's celebrated uncertainty principle. Just as the classical result provides a tradeoff between signal localization in time and frequency, our result provides a fundamental tradeoff between a signal's localization on a graph and in its spectral domain.