Bounds on graph eigenvalues II

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2006-12-16
dc.date2007-03-06
dc.date.accessioned2026-07-07T07:50:08Z
dc.date.available2026-07-07T07:50:08Z
dc.descriptionSome recent results on graph eigenvalues are improved. In particular, among all graphs of given order with no cliques of order $(r+1)$ the $r$-partite Turan graph has maximal spectral radius.
dc.identifierhttps://arxiv.org/abs/math/0612461
dc.identifierhttp://arxiv.org/abs/math/0612461
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/125067
dc.subjectCombinatorics
dc.subject05C50
dc.titleBounds on graph eigenvalues II
dc.typetext

Files

Collections

arXiv