Abstract
We determine a lower bound for the spectral radius of a graph in terms of the number of vertices and the diameter of the graph. For the specific case of graphs with diameter three we give a slightly better bound. We also construct families of graphs with small spectral radius, thus obtaining asymptotic results showing that the bound is of the right order. We also relate these results to the extremal degree/diameter problem.
| Original language | English |
|---|---|
| Pages (from-to) | 1560-1566 |
| Journal | European Journal of Combinatorics |
| Volume | 31 |
| Issue number | 6 |
| Publication status | Published - 2010 |