My favorite application using eigenvalues : Eigenvalues and the Graham-Pollak Theorem

@inproceedings{Winter2013MyFA,
  title={My favorite application using eigenvalues : Eigenvalues and the Graham-Pollak Theorem},
  author={Michael Winter},
  year={2013}
}
The famous Graham-Pollak Theorem states that one needs at least n− 1 complete bipartite subgraphs to partition the edge set of the complete graph on n vertices. Originally proved in conjunction with addressing for networking problems, this theorem is also related to perfect hashing and various questions about communication complexity. Since it’s original… CONTINUE READING