Walks and the spectral radius of graphs
arXiv:math/0506259
Abstract
We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.
Corrections were made in Theorems 5 and 11 (the new numbers are different), following a remark of professor Yaoping Hou