-spectral radius of a connected graph after vertex deletion.
Chunxiang WangTao ShePublished in: RAIRO Oper. Res. (2022)
Keyphrases
- directed graph
- connected components
- undirected graph
- hamiltonian cycle
- labeled graphs
- random walk
- vertex set
- spectral decomposition
- minimum weight
- edge weights
- graph representation
- attributed graphs
- normalized cut
- graph theory
- graph model
- directed acyclic graph
- graph partitioning
- graph based algorithm
- spectral analysis
- strongly connected
- connected graphs
- graph structure
- neighborhood graph
- hyperspectral
- bipartite graph
- maximum cardinality
- weighted graph
- laplacian matrix
- betweenness centrality
- minimum spanning tree
- spectral features
- graph grammars
- graph laplacian
- graph clustering
- multispectral images
- binary images
- structured data