arXiv Analytics

Sign in

arXiv:math/0612461 [math.CO]AbstractReferencesReviewsResources

Bounds on graph eigenvalues II

Vladimir Nikiforov

Published 2006-12-16, updated 2007-03-06Version 2

Some recent results on graph eigenvalues are improved. In particular, among all graphs of given order with no cliques of order $(r+1)$ the $r$-partite Turan graph has maximal spectral radius.

Categories: math.CO
Subjects: 05C50
Related articles: Most relevant | Search more
arXiv:math/0210365 [math.CO] (Published 2002-10-23, updated 2003-03-11)
The maximal spectral radius of a digraph with (m+1)^2 - s edges
arXiv:math/0608198 [math.CO] (Published 2006-08-08, updated 2006-10-02)
Linear combinations of graph eigenvalues
arXiv:2303.10488 [math.CO] (Published 2023-03-18)
Subdivision and Graph Eigenvalues

Links

Toolbox