Linked from

The 11 pages that link to Laplacian matrix, each with the reason it gives.

• Adjacency matrixRelated: Subtracting adjacency from degree information turns links into a matrix for graph structure.

• Incidence matrixRelated: For an oriented incidence matrix B, the product BBᵀ is the graph Laplacian.

• Sparse matrixRelated: For sparse graphs, its nonzero pattern is sparse and reflects local connections.

• Path graphRelated: For a path graph, its tridiagonal form encodes local connections and endpoint degrees.

• Symmetric matrixRelated: For an undirected graph, its Laplacian is symmetric and encodes graph structure.

• Undirected graphRelated: For undirected graphs, its symmetry links connectivity to eigenvalues.

• Conjugate gradient methodRelated: Regularized graph problems can lead to sparse positive-definite systems solved by conjugate gradients.

• Degree matrixRelated: It combines the degree matrix with adjacency to capture graph structure algebraically.

• Spectral graph theoryRelated: Its spectrum directly reveals connected components and supports many structural bounds.

• Kirchhoff's theoremBroader topic: Its principal cofactors contain the spanning-tree count.

• Ioana DumitriuRelated: Its spectrum turns network questions into problems about eigenvalues.