Chromatic number and spectral radius

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2007-02-24
dc.date2007-06-06
dc.date.accessioned2026-07-07T08:04:15Z
dc.date.available2026-07-07T08:04:15Z
dc.descriptionLet G be a graph, H be its chromatic number, L be the largest eigenvalue of its Laplacian, and M be the largest eigenvalue of its adjacency matrix. Then, complementing a well-known result of Hoffman, we show that L>=(H/(H-1))M
dc.identifierhttps://arxiv.org/abs/math/0702723
dc.identifierhttp://arxiv.org/abs/math/0702723
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/129886
dc.subjectCombinatorics
dc.subject05C50
dc.titleChromatic number and spectral radius
dc.typetext

Files

Collections

arXiv