On the spectral Ádám property for circulant graphs.
Bernard MansFrancesco PappalardiIgor E. ShparlinskiPublished in: Discret. Math. (2002)
Keyphrases
- spectral decomposition
- graph matching
- graph properties
- spectral analysis
- least squares
- spectral methods
- directed graph
- fourier transform
- laplacian matrix
- graph databases
- series parallel
- bipartite graph
- spectral data
- graph theory
- graph clustering
- graph theoretic
- hyperspectral imagery
- adjacency matrix
- graph construction
- undirected graph
- normalized cut
- hyperspectral images
- complex structures
- data sets
- graph mining
- weighted graph
- hyperspectral
- random walk
- pairwise
- objective function
- bayesian networks