The smallest eigenvalue of K_p-free graphs

Simple item page
dc.creatorNikiforov, V.
dc.date2004-10-08
dc.date.accessioned2026-07-07T05:13:04Z
dc.date.available2026-07-07T05:13:04Z
dc.descriptionWe give an upper bound on the smallest eigenvalue of the adjacency matrix of graphs with no p-cliques.
dc.description4 pages
dc.identifierhttps://arxiv.org/abs/math/0410216
dc.identifierhttp://arxiv.org/abs/math/0410216
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72808
dc.subjectCombinatorics
dc.subject05C35
dc.titleThe smallest eigenvalue of K_p-free graphs
dc.typetext

Files

Collections

arXiv