Let G be a simple, undirected graph. A spanning tree of G is a subgraph of G that is a tree with the same vertex set as G. The Laplacian matrix L of G is the difference between the graph's degree matrix (the diagonal matrix of vertex degrees)