Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph.
Ayse Dilek MadenKinkar Chandra DasA. Sinan ÇevikPublished in: Appl. Math. Comput. (2013)
Keyphrases
- laplacian matrix
- upper bound
- spectral methods
- spectral decomposition
- graph laplacian
- adjacency matrix
- spectral clustering
- low dimensional
- covariance matrix
- lower bound
- pseudo inverse
- graph kernels
- spectral analysis
- weighted graph
- heat kernel
- random walk
- graph structure
- graph partitioning
- graph representation
- manifold learning
- graph clustering
- graph structures
- eigendecomposition
- weight matrix
- minimum spanning tree
- graph model
- alpha matte
- semi supervised
- basis functions