Spectral Radius and maximum degree of connected graphs
Combinatorics
2007-05-23 v1
Abstract
We give an upper bound on the maximal eigenvalue of the adjacency matrix of a connected graph in terms of its maximum degree, diameter and order. This bound is best possible up to a constant factor and improves prevoius results of Stevanovic, Zhang, and Alon and Sudakov.
Cite
@article{arxiv.math/0602028,
title = {Spectral Radius and maximum degree of connected graphs},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:math/0602028},
year = {2007}
}