Spectral graph theory is a branch of mathematics that studies the properties of graphs through the eigenvalues and eigenvectors of matrices associated with them. These matrices include the adjacency matrix, the degree matrix, and the Laplacian matrix, among others. Spectral graph theory connects combinatorial properties of graphs with linear algebra and provides powerful tools for analyzing graphs in various contexts.
Articles by others on the same topic
Spectral graph theory studies a graph through eigenvalues and eigenvectors of associated matrices, especially its adjacency matrix and graph Laplacian. A graph eigenvalue usually means an adjacency eigenvalue unless another matrix is specified.
For an undirected graph, the Laplacian satisfies . Its kernel therefore consists of vectors constant on each connected component, so the multiplicity of zero equals the number of components. This makes a discrete connectivity property visible in linear algebra. Nonzero eigenvalues further quantify mixing, expansion, and the cost of varying across edges.