Sharp spectral bounds for the edge-connectivity of regular graphs.
Suil OJeong Rye ParkJongyook ParkWenqian ZhangPublished in: Eur. J. Comb. (2023)
Keyphrases
- weighted graph
- spectral decomposition
- strongly connected
- undirected graph
- sharp edges
- lower bound
- upper bound
- spectral methods
- spectral analysis
- edge detection
- minimum spanning trees
- graph connectivity
- edge weights
- edge information
- vertex set
- error bounds
- smooth regions
- edge detector
- graph representation
- topological information
- directed graph
- connected components
- graph theoretic
- upper and lower bounds
- high quality
- normalized cut
- hyperspectral images
- graph kernels
- lower and upper bounds
- vc dimension
- graph matching
- random graphs
- adjacency matrix
- learning algorithm
- topological features
- spanning tree
- graph structure
- laplacian matrix
- hyperspectral
- adjacency graph
- bipartite graph
- image processing