Spectral characterizations of graphs with at most two (signless) Laplacian eigenvalues greater than 2.
Xiyuan FengJianfeng WangFrancesco BelardoPublished in: Ars Comb. (2018)
Keyphrases
- laplacian matrix
- spectral decomposition
- spectral methods
- spectral clustering
- adjacency matrix
- graph laplacian
- covariance matrix
- heat kernel
- low dimensional
- graph kernels
- spectral analysis
- pseudo inverse
- random walk
- graph structure
- alpha matte
- shape analysis
- weighted graph
- graph partitioning
- pairwise
- graph clustering
- manifold learning
- graph matching
- directed graph
- vector space
- clustering method
- kernel matrix
- laplace beltrami
- kernel methods
- image segmentation
- acyclic database schemes