Two Sharp Upper Bounds for the signless Laplacian spectral radius of Graphs.
Ya-Hong ChenRong-Ying PanXiao-Dong ZhangPublished in: Discret. Math. Algorithms Appl. (2011)
Keyphrases
- upper bound
- spectral decomposition
- laplacian matrix
- lower bound
- upper and lower bounds
- worst case
- adjacency matrix
- graph structures
- branch and bound algorithm
- efficiently computable
- graph theoretic
- tight upper and lower bounds
- lower and upper bounds
- sample complexity
- graph theory
- graph matching
- low dimensional
- edge detection
- graph kernels
- directed graph
- sample size
- tight bounds
- graph mining
- spectral clustering
- concept classes
- graph laplacian
- hyperspectral imagery
- heat kernel
- special case
- clustering algorithm