The Moore bound for Spectral Radius
Combinatorics
2007-05-23 v2
Abstract
We give an upper bound on the largest eigenvalue of a graph of given order, size, and girth.
Keywords
Cite
@article{arxiv.math/0701237,
title = {The Moore bound for Spectral Radius},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:math/0701237},
year = {2007}
}
Comments
The second version corrects a stupid mistake