A lower bound for the spectral radius of graphs with fixed diameter.
Sebastian M. CioabaEdwin R. van DamJack H. KoolenJae-Ho LeePublished in: Eur. J. Comb. (2010)
Keyphrases
- lower bound
- upper bound
- spectral decomposition
- branch and bound
- spectral methods
- branch and bound algorithm
- objective function
- lower and upper bounds
- weighted graph
- optimal solution
- spectral analysis
- graph representation
- graph matching
- worst case
- np hard
- graph theory
- graph mining
- directed graph
- average degree
- bipartite graph
- graph theoretic