An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications.
Jianxi LiJi-Ming GuoWai Chee ShiuAn ChangPublished in: Discret. Appl. Math. (2014)
Keyphrases
- weighted graph
- laplacian matrix
- graph laplacian
- edge detection
- undirected graph
- disjoint paths
- edge weights
- adjacency matrix
- random walk
- directed graph
- spectral decomposition
- graph theory
- graph model
- vertex set
- graph structure
- graph partitioning
- covariance matrix
- spectral clustering
- shortest path
- strongly connected components
- least squares
- zero crossing
- graph matching
- connected components
- graph clustering
- strongly connected
- graph theoretic
- spanning tree
- graph databases