On the spectral radius of graphs with k-vertex cut.
Guoping WangQiongxiang HuangJing CaiPublished in: Ars Comb. (2008)
Keyphrases
- vertex set
- undirected graph
- directed graph
- spectral decomposition
- normalized cut
- attributed graphs
- labeled graphs
- graph clustering
- spanning tree
- planar graphs
- minimum weight
- graph structure
- average degree
- spectral methods
- laplacian matrix
- hamiltonian cycle
- graph matching
- maximum cardinality
- connected subgraphs
- adjacency matrix
- random graphs
- spectral analysis
- image segmentation
- edge weights
- bipartite graph
- graph partitioning
- graph model
- weighted graph
- graphical models
- random walk
- spectral clustering
- hyperspectral
- graph theory
- graph mining
- graph databases
- min cut
- subgraph isomorphism
- graph representation
- hyperspectral imagery
- graph structures