Eigenvalues and extremal degrees in graphs
Combinatorics
2007-05-23 v2
Abstract
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
Cite
@article{arxiv.math/0605071,
title = {Eigenvalues and extremal degrees in graphs},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:math/0605071},
year = {2007}
}