A lower bound for the sum of the two largest signless Laplacian eigenvalues.
Carla Silva OliveiraLeonardo Silva de LimaPublished in: Electron. Notes Discret. Math. (2016)
Keyphrases
- lower bound
- objective function
- upper bound
- covariance matrix
- branch and bound algorithm
- min sum
- laplacian matrix
- np hard
- lower and upper bounds
- optimal solution
- branch and bound
- eigenvalues and eigenvectors
- principal components
- edge detection
- worst case
- covariance matrices
- kernel matrix
- graph laplacian
- lower bounding
- learning algorithm
- spectral clustering
- square error
- polynomial approximation
- high dimensional
- semi supervised
- competitive ratio
- online algorithms
- lagrangian relaxation
- sample complexity
- weighted sum