Upper bounds for the sum of Laplacian eigenvalues of a graph and Brouwer's conjecture.
Hilal A. GanieShariefuddin PirzadaRezwan Ul ShabanX. LiPublished in: Discret. Math. Algorithms Appl. (2019)
Keyphrases
- upper bound
- laplacian matrix
- lower bound
- graph laplacian
- adjacency matrix
- spectral decomposition
- spectral clustering
- eigenvalues and eigenvectors
- lower and upper bounds
- spectral methods
- covariance matrix
- linear functions
- weighted graph
- graph theory
- structured data
- worst case
- bipartite graph
- random walk
- directed acyclic graph
- upper and lower bounds
- constant factor
- graph model
- min sum
- graph construction
- spectral analysis
- efficiently computable
- graph representation
- sample complexity
- graph structure
- branch and bound algorithm
- minimum spanning tree
- graph databases
- social networks
- graph matching
- heat kernel
- directed graph
- low dimensional
- semi supervised
- objective function
- image segmentation