Graphs with extremal energy should have a small number of distinct eigenvalues

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

The sum of the absolute values of the eigenvalues of a graph is called the energy of the graph. We study the problem of finding graphs with extremal energy within specified classes of graphs. We develop tools for treating such problems and obtain some partial results. Using calculus, we show that an extremal graph ``should'' have a small number of distinct eigenvalues. However, we also present data that shows in many cases that extremal graphs can have a large number of distinct eigenvalues.
17 pages; contains a SAGE program and minor grammatical corrections that are not contained in the published version

Keywords

Combinatorics, 05C50

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0710.5669
 http://arxiv.org/abs/0710.5669
 Cvetkovi\' c D., Grout J., Maximal energy graphs should have a small number of distinct eigenvalues, Bull. Acad. Serbe Sci. Arts, Cl. Sci. Math. Natur., Sci. Math., 134(2007), No. 32, 43-57

Collections

arXiv