An upper bound on the Laplacian spectral radius of the signed graphs.
Hong-Hai LiJiong-Sheng LiPublished in: Discuss. Math. Graph Theory (2008)
Keyphrases
- upper bound
- spectral decomposition
- laplacian matrix
- lower bound
- worst case
- branch and bound algorithm
- spectral methods
- graph structures
- graph theory
- adjacency matrix
- lower and upper bounds
- branch and bound
- spectral clustering
- graph matching
- spectral features
- graph databases
- graph laplacian
- graph representation
- low dimensional
- graph mining
- graph structure
- hyperspectral
- graph partitioning
- error probability
- image processing
- heat kernel
- directed graph