Keywords
MathematicsAdjacency matrixLaplacian matrixCombinatoricsAlgebraic connectivityDegree matrixDiagonal matrixVertex (graph theory)Laplace operatorInteger matrixDiagonalMatrix (chemical analysis)GraphDiscrete mathematicsSymmetric matrixEigenvalues and eigenvectorsNonnegative matrixGraph powerLine graphPhysics
Affiliated Institutions
Related Publications
Partitioning Sparse Matrices with Eigenvectors of Graphs
The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An ...
On the Quality of Spectral Separators
Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators involves spectral methods. However, there has not been much ...
Lower Bounds for the Partitioning of Graphs
Let a k-partition of a graph be a division of the vertices into k disjoint subsets containing m <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.or...
Numerical operator calculus in higher dimensions
When an algorithm in dimension one is extended to dimension d , in nearly every case its computational cost is taken to the power d . This fundamental difficulty is the single g...
Publication Info
- Year
- 1994
- Type
- article
- Volume
- 197-198
- Pages
- 143-176
- Citations
- 1473
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1473
OpenAlex
Cite This
Russell Merris
(1994).
Laplacian matrices of graphs: a survey.
Linear Algebra and its Applications
, 197-198
, 143-176.
https://doi.org/10.1016/0024-3795(94)90486-3
Identifiers
- DOI
- 10.1016/0024-3795(94)90486-3