A survey of graph laplacians

Let G be a graph on n vertices. Its Laplacian is the n-by-n matrix L(G)−D(G)−A(G), where D(G) is the diagonal matrix of vertex degrees and A(G) is the (0,1)-adjacency matrix of G. This article surveys recent results on graph Laplacians.