On the Energy of Singular and Non Singular Graphs
Keywords: LOWER BOUNDS, NUMBER, TREES
Abstract
Let G be a simple undirected graph with n vertices, m edges, adjacency matrix A, largest eigenvalue Ï and nullity κ. The energy of G, â(G) is the sum of its singular values. In this work lower bounds for â(G) in terms of the coefficient of μκin the expansion of characteristic polynomial, p(μ) = det (μI - A) are obtained. In particular one of the bounds generalizes a lower bound obtained by K. Das, S. A. Mojallal and I. Gutman in 2013 to the case of graphs with given nullity. The bipartite case is also studied obtaining in this case, a sufficient condition to improve the spectral lower bound 2Ï. Considering an increasing sequence convergent to Ï a convergent increasing sequence of lower bounds for the energy of G is constructed.
Más información
| Título según SCOPUS: | On the energy of singular and non singular graphs |
| Título de la Revista: | Match |
| Volumen: | 83 |
| Número: | 3 |
| Editorial: | University of Kragujevac, Faculty of Science |
| Fecha de publicación: | 2020 |
| Página final: | 610 |
| Idioma: | English |
| Financiamiento/Sponsor: | UNIVERSIDAD CATÓLICA DEL NORTE |
| URL: | http://match.pmf.kg.ac.rs/electronic_versions/Match83/n3/match83n3_593-610.pdf |
| Notas: | SCOPUS - ISI |