Spectral Moments of the Edge Adjacency Matrix in Molecular Graphs. 3. Molecules Containing Cycles.
Ernesto EstradaPublished in: J. Chem. Inf. Comput. Sci. (1998)
Keyphrases
- adjacency matrix
- weighted graph
- laplacian matrix
- undirected graph
- normalized cut
- graph matching
- graph representation
- graph edit distance
- graph partitioning
- graph clustering
- spectral methods
- eigenvalues and eigenvectors
- directed graph
- graph model
- spectral analysis
- graph structure
- shortest path
- edge weights
- spanning tree
- approximation algorithms
- spectral clustering
- data objects
- clustering algorithm
- connected components
- edge detection
- directed acyclic graph
- positive definite
- graph laplacian
- mean shift
- k means