Year: 2005
Type: preprint
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).
Source: arXiv (Cornell University)
Author: Nikiforov, Vladimir
Institution: University of Memphis
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2952921729