Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/27207
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Andrade, Enide | pt_PT |
dc.contributor.author | Lenes, Eber | pt_PT |
dc.contributor.author | Mallea-Zepeda, Exequiel | pt_PT |
dc.contributor.author | Robbiano, María | pt_PT |
dc.contributor.author | Rodríguez Z., Jonnathan | pt_PT |
dc.date.accessioned | 2019-12-18T16:16:38Z | - |
dc.date.issued | 2020-03-01 | - |
dc.identifier.issn | 0024-3795 | pt_PT |
dc.identifier.uri | http://hdl.handle.net/10773/27207 | - |
dc.description.abstract | Let $\mathcal{G}$ be a simple undirected connected graph. The signless Laplacian Estrada, Laplacian Estrada and Estrada indices of a graph $\mathcal{G}$ is the sum of the exponentials of the signless Laplacian eigenvalues, Laplacian eigenvalues and eigenvalues of $\mathcal{G}$, respectively. The present work derives an upper bound for the Estrada index of a graph as a function of its chromatic number, in the family of graphs whose color classes have order not less than a fixed positive integer. The graphs for which the upper bound is tight is obtained. Additionally, an upper bound for the Estrada Index of the complement of a graph in the previous family of graphs with two color classes is given. A Nordhaus-Gaddum type inequality for the Laplacian Estrada index when {$\mathcal{G}$ is a bipartite} graph with color classes of order not less than $2$, is presented. Moreover, a sharp upper bound for the Estrada index of the line graph and for the signless Laplacian index of a graph in terms of connectivity is obtained. | pt_PT |
dc.language.iso | eng | pt_PT |
dc.publisher | Elsevier | pt_PT |
dc.relation | UID/MAT/04106/2019 | pt_PT |
dc.rights | openAccess | pt_PT |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | pt_PT |
dc.subject | Estrada index | pt_PT |
dc.subject | Signless Laplacian Estrada index | pt_PT |
dc.subject | Laplacian Estrada index | pt_PT |
dc.subject | Chromatic number | pt_PT |
dc.subject | Vertex connectivity | pt_PT |
dc.subject | Edge connectivity | pt_PT |
dc.subject | Line graph | pt_PT |
dc.title | Extremal graphs for Estrada indices | pt_PT |
dc.type | article | pt_PT |
dc.description.version | published | pt_PT |
dc.peerreviewed | yes | pt_PT |
degois.publication.firstPage | 54 | pt_PT |
degois.publication.lastPage | 73 | pt_PT |
degois.publication.title | Linear Algebra and its Applications | pt_PT |
degois.publication.volume | 588 | pt_PT |
dc.date.embargo | 2021-03-01 | - |
dc.identifier.doi | 10.1016/j.laa.2019.10.029 | pt_PT |
Appears in Collections: | CIDMA - Artigos DMat - Artigos OGTCG - Artigos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
EStrada indices.pdf | 317.94 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.