The Moore bound for Spectral Radius

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2007-01-08
dc.date2007-02-02
dc.date.accessioned2026-07-07T07:44:15Z
dc.date.available2026-07-07T07:44:15Z
dc.descriptionWe give an upper bound on the largest eigenvalue of a graph of given order, size, and girth.
dc.descriptionThe second version corrects a stupid mistake
dc.identifierhttps://arxiv.org/abs/math/0701237
dc.identifierhttp://arxiv.org/abs/math/0701237
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123132
dc.subjectCombinatorics
dc.subject05C50
dc.titleThe Moore bound for Spectral Radius
dc.typetext

Files

Collections

arXiv