Eigenvalues and degree deviation in graphs
Combinatorics
2007-05-23 v1
Abstract
Given 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).
Keywords
Cite
@article{arxiv.math/0506257,
title = {Eigenvalues and degree deviation in graphs},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:math/0506257},
year = {2007}
}