The characterization of graphs with the largest Laplacian eigenvalue at most 5+sqrt(13)/2.
G. R. OmidiPublished in: Ars Comb. (2010)
Keyphrases
- laplacian matrix
- spectral decomposition
- lower bound
- worst case
- least squares
- covariance matrix
- weighted majority
- edge detection
- directed graph
- graph databases
- random graphs
- graph construction
- graph theory
- series parallel
- differential operators
- graph kernels
- image processing
- spectral clustering
- upper bound
- similarity measure