Laplacian Largest Eigenvalue

Keyword: LapLargest

The Laplacian largest eigenvalue of a graph G is the largest eigenvalue of its Laplacian matrix L, defined by L = D - A where A is the adjacency matrix of G and D is a diagonal matrix where Di,i is the degree of vertex i.