An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian.
Fan R. K. ChungVance FaberThomas A. ManteuffelPublished in: SIAM J. Discret. Math. (1994)
Keyphrases
- upper bound
- laplacian matrix
- lower bound
- graph laplacian
- adjacency matrix
- spectral decomposition
- worst case
- weighted graph
- spectral methods
- branch and bound algorithm
- graph model
- graph theoretic
- eigenvalues and eigenvectors
- average degree
- constant factor
- graph matching
- graph structure
- branch and bound
- multiscale
- error probability
- sample size
- heat kernel
- singular value decomposition
- neighborhood graph
- graph representation
- bipartite graph
- spectral clustering
- graph kernels
- spectral analysis
- covariance matrix
- principal components
- graph classification
- graph mining
- structured data
- low dimensional