Bounds on graph eigenvalues II
Combinatorics
2007-05-23 v2
Abstract
Some recent results on graph eigenvalues are improved. In particular, among all graphs of given order with no cliques of order the -partite Turan graph has maximal spectral radius.
Cite
@article{arxiv.math/0612461,
title = {Bounds on graph eigenvalues II},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:math/0612461},
year = {2007}
}