Vladimir Nikiforov
Published 2005-06-13, updated 2006-05-02Version 2
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.
Comments: Corrections were made in Theorems 5 and 11 (the new numbers are different), following a remark of professor Yaoping Hou
The spectral radius of the square of graphs
Eigenvalues and degree deviation in graphs
Crossings, colorings, and cliques
![QR code for arXiv:math/0506259 [math.CO]](http://oss.arxitics.com/images/favicon.svg)