Bounding the sum of the largest Laplacian eigenvalues of graphs.
Israel RochaVilmar TrevisanPublished in: Discret. Appl. Math. (2014)
Keyphrases
- laplacian matrix
- spectral decomposition
- upper bound
- spectral methods
- covariance matrix
- spectral clustering
- graph databases
- graph theory
- graph matching
- graph laplacian
- graph theoretic
- pseudo inverse
- structured data
- adjacency matrix
- principal component analysis
- graph kernels
- graph clustering
- complex structures
- eigenvalues and eigenvectors
- objective function
- graph mining
- graph structure
- directed graph
- lower bound
- weighted sum
- weighted graph
- principal components
- graphical models
- multiscale