Sharp bounds for the signless Laplacian spectral radius of digraphs.
Weiwei LangLigong WangPublished in: Appl. Math. Comput. (2014)
Keyphrases
- spectral decomposition
- upper bound
- laplacian matrix
- lower bound
- worst case
- upper and lower bounds
- tight bounds
- directed graph
- equivalence classes
- multispectral images
- lower and upper bounds
- high quality
- hyperspectral imagery
- spectral analysis
- average case
- hyperspectral
- spectral images
- image processing
- semi supervised feature selection
- video matting
- markov models
- sparse coding
- spectral data
- sample size
- random walk