# Are there any applications of Algebraic Graph Theory to Computer Science?

Clearly graph theory has many applications in computer science. But what about algebraic graph theory and the techniques pertaining to it?

Most of the applications I can find are related to chemistry and the natural sciences (for example, eigenvalues of graphs have physical meaning when they represent mollecules). But how can we use the techniques of linear algebra to learn things about graphs in an algorithmic/computer science setting?

Loosely speaking, the Page Rank algorithm in it's most simple form finds the eigenvector of the stochastic adjacency matrix that corresponds to the eigenvalue $\lambda=1$.