Eigenvalues and degree deviation in graphs

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2005-06-13
dc.date.accessioned2026-07-07T05:20:43Z
dc.date.available2026-07-07T05:20:43Z
dc.descriptionGiven a graph G of order n and size m, let s(G)= sum|d(u)-2m/n|, where the sum is taken over all vertices u of G. We investigate upper and lower bounds on eigenvalues of G in terms of s(G).
dc.identifierhttps://arxiv.org/abs/math/0506257
dc.identifierhttp://arxiv.org/abs/math/0506257
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75480
dc.subjectCombinatorics
dc.subject15A42, 05C50
dc.titleEigenvalues and degree deviation in graphs
dc.typetext

Files

Collections

arXiv