The Moore bound for Spectral Radius

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We give an upper bound on the largest eigenvalue of a graph of given order, size, and girth.
The second version corrects a stupid mistake

Keywords

Combinatorics, 05C50

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/123132

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0701237
 http://arxiv.org/abs/math/0701237

Collections

arXiv