Walks and the spectral radius of graphs
Combinatorics
2007-05-23 v2
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.
Cite
@article{arxiv.math/0506259,
title = {Walks and the spectral radius of graphs},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:math/0506259},
year = {2007}
}
Comments
Corrections were made in Theorems 5 and 11 (the new numbers are different), following a remark of professor Yaoping Hou