A sufficient Q-spectral condition for a graph to be β-deficient involving minimum degree.
Weijun LiuZheng HuangYongtao LiLihua FengPublished in: Discret. Appl. Math. (2019)
Keyphrases
- graph structure
- spectral decomposition
- spanning tree
- sufficient conditions
- random walk
- connected dominating set
- dominating set
- random graphs
- normalized cut
- graph matching
- spectral methods
- graph theory
- bipartite graph
- graphical models
- edge disjoint
- spectral graph partitioning
- remote sensing
- hyperspectral imagery
- graph structures
- graph search
- directed graph
- graph theoretic
- graph model
- directed acyclic graph
- weighted graph
- spectral analysis
- minimum spanning tree
- multispectral images
- undirected graph
- constant factor
- stable set
- structured data
- graph mining