Walks and the spectral radius of graphs

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2005-06-13
dc.date2006-05-02
dc.date.accessioned2026-07-07T06:42:25Z
dc.date.available2026-07-07T06:42:25Z
dc.descriptionWe 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.
dc.descriptionCorrections were made in Theorems 5 and 11 (the new numbers are different), following a remark of professor Yaoping Hou
dc.identifierhttps://arxiv.org/abs/math/0506259
dc.identifierhttp://arxiv.org/abs/math/0506259
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/102035
dc.subjectCombinatorics
dc.subject15A42, 05C50
dc.titleWalks and the spectral radius of graphs
dc.typetext

Files

Collections

arXiv