Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs.
Kinkar Chandra DasPublished in: Discret. Math. (2012)
Keyphrases
- laplacian matrix
- theorem prover
- spectral decomposition
- covariance matrix
- spectral methods
- low dimensional
- adjacency matrix
- graph kernels
- eigenvalues and eigenvectors
- spectral clustering
- graph matching
- graph laplacian
- geometry theorem proving
- theorem proving
- graph structures
- edge detection
- graph theory
- inference rules
- heat kernel
- principal components
- graph partitioning
- complex structures
- graph structure
- sparse coding
- directed graph
- symmetric matrices
- dimensionality reduction