Bounding the sum of the largest signless Laplacian eigenvalues of a graph.
Aida AbiadLeonardo Silva de LimaSina KalantarzadehMona MohammadiCarla Silva OliveiraPublished in: Discret. Appl. Math. (2023)
Keyphrases
- laplacian matrix
- graph laplacian
- random walk
- graph theoretic
- graph structure
- directed graph
- upper bound
- spectral decomposition
- spectral methods
- covariance matrix
- spectral clustering
- low dimensional
- weighted sum
- objective function
- min sum
- graph model
- weighted graph
- connected components
- spanning tree
- graph kernels
- bipartite graph
- directed acyclic graph
- graph mining
- graph theory
- graph construction
- structured data
- heat kernel
- edge detection
- graph matching
- principal components