arXiv:math/0602028 Abstract

arXiv:math/0602028 [math.CO]Abstract References Reviews Resources

Spectral Radius and maximum degree of connected graphs

Published 2006-02-01Version 1

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.

Categories: math.CO

Subjects: 15A42

Keywords: maximum degree, connected graph, spectral radius, upper bound, maximal eigenvalue

Related articles: Most relevant | Search more

arXiv:1404.7286 [math.CO] (Published 2014-04-29)

The spectral radius of the square of graphs

Yi-Zheng Fan, Long Wang

arXiv:1601.02099 [math.CO] (Published 2016-01-09)

Dynamic Monopolies for Degree Proportional Thresholds in Connected Graphs of Girth at least Five and Trees

Dieter Rautenbach

arXiv:1512.00726 [math.CO] (Published 2015-12-02)

Total proper connection of graphs