A lower bound on the spectral radius of the universal cover of a graph.
Shlomo HooryPublished in: J. Comb. Theory, Ser. B (2005)
Keyphrases
- lower bound
- upper bound
- lower and upper bounds
- optimal solution
- branch and bound
- graph structure
- directed graph
- spectral decomposition
- graph representation
- graph model
- branch and bound algorithm
- np hard
- objective function
- spectral methods
- graph theory
- worst case
- normalized cut
- adjacency matrix
- random walk
- laplacian matrix
- learning algorithm
- weighted graph
- directed acyclic graph
- graph clustering
- graph matching
- graph theoretic
- graph partitioning
- connected components
- remote sensing
- linear programming
- social networks