Keywords
Eigenvalues and eigenvectorsMarkov chainLaplace transformMathematicsSemidefinite programmingIsoperimetric inequalityCombinatoricsPartition (number theory)Graph partitionDiscrete mathematicsGraphMathematical optimizationMathematical analysisPhysicsStatistics
Affiliated Institutions
Related Publications
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...
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 ...
Random graphs with arbitrary degree distributions and their applications
Recent work on the structure of social networks and the internet has focused attention on graphs with distributions of vertex degree that are significantly different from the Po...
New spectral methods for ratio cut partitioning and clustering
Partitioning of circuit netlists in VLSI design is considered. It is shown that the second smallest eigenvalue of a matrix derived from the netlist gives a provably good approxi...
Publication Info
- Year
- 1997
- Type
- book-chapter
- Pages
- 225-275
- Citations
- 419
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
419
OpenAlex
Cite This
Bojan Mohar
(1997).
Some applications of Laplace eigenvalues of graphs.
, 225-275.
https://doi.org/10.1007/978-94-015-8937-6_6
Identifiers
- DOI
- 10.1007/978-94-015-8937-6_6