Sharp bounds for spectral radius of Dα-matrix of graphs.
Hilal A. GaniePublished in: Discret. Math. Algorithms Appl. (2023)
Keyphrases
- spectral decomposition
- laplacian matrix
- adjacency matrix
- upper bound
- lower bound
- spectral methods
- eigenvalues and eigenvectors
- upper and lower bounds
- graph matching
- graph theoretic
- covariance matrix
- graph structures
- spectral clustering
- graph kernels
- graph representation
- singular value decomposition
- fisher information
- lower and upper bounds
- low dimensional
- graph structure
- graph theory
- low rank
- error bounds
- directed graph
- pseudo inverse
- high quality
- spectral relaxation
- hyperspectral imagery
- contingency tables
- undirected graph
- graph databases
- hyperspectral
- random walk
- worst case