Laplacian matrix
Builds on GraphAdjacency matrixDegree of a vertexSymmetric matrixPositive semidefinite matrix
Definition
Let be a finite simple graph with vertices . Let be the diagonal matrix with , the degree of , and let be the adjacency matrix of . The Laplacian matrix of is the matrix . So , if and is an edge, and otherwise.
Remarks
For every real vector , , the sum running over the edges .
Hence is symmetric and positive semidefinite, the all-ones vector lies in its kernel, and the multiplicity of the eigenvalue equals the number of connected components of .
Example: for the path ,
whose eigenvalues are , and , with eigenvectors , and .
Non-example: the matrix has the right diagonal but the wrong sign off the diagonal.
It is the signless Laplacian, and it has the same spectrum as when is bipartite, but not in general.
The normalized Laplacian , defined when no vertex is isolated, is also common.
Mathlib defines the Laplacian matrix as SimpleGraph.lapMatrix.
Reading path
To understand this page from the ground up, read these 12 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Graph definition
- Matrix definition
- Adjacency matrix definition
- Neighbourhood definition
- Square matrix definition
- Transpose definition
- Degree of a vertex definition
- Symmetric matrix definition
- Conjugate transpose definition
- Hermitian matrix definition
- Positive semidefinite matrix definition
- Laplacian matrix definition
Further reading
About this page
| Tag | 7YBM0AXY23 |
|---|---|
| URI | m2://7YBM0AXY23 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 05C50 |
| Defines | Laplacian matrix |
| Uses | Graph, Adjacency matrix, Degree of a vertex, Symmetric matrix, Positive semidefinite matrix |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.