Walks and the spectral radius of graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Combinatorics, 15A42, 05C50

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/102035

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0506259
 http://arxiv.org/abs/math/0506259

Collections

arXiv