The smallest eigenvalue of K_p-free graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We give an upper bound on the smallest eigenvalue of the adjacency matrix of graphs with no p-cliques.
4 pages

Keywords

Combinatorics, 05C35

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv