Bounds for the Distance Estrada Index of Graphs
| dc.contributor.author | Altındağ, Ş. Burcu Bozkurt | |
| dc.contributor.author | Bozkurt, Durmuş | |
| dc.date.accessioned | 2020-03-26T19:01:10Z | |
| dc.date.available | 2020-03-26T19:01:10Z | |
| dc.date.issued | 2015 | |
| dc.department | Selçuk Üniversitesi | en_US |
| dc.description | International Conference on Numerical Analysis and Applied Mathematics (ICNAAM) -- SEP 22-28, 2014 -- Rhodes, GREECE | en_US |
| dc.description.abstract | Let G be simple connected graph with n vertices. The distance eigenvalues mu(1) >= mu(2) >= ... >= mu(n) of G are the eigenvalues of its distance matrix D(G). The distance Estrada index of G is defined as DEE(G) = Sigma(n)(i=1) e(mu) [14]. In this paper, we establish better lower bounds for DEE (G) as well as some relations between DEE(G) and the distance energy. | en_US |
| dc.identifier.doi | 10.1063/1.4912608 | en_US |
| dc.identifier.isbn | 978-0-7354-1287-3 | |
| dc.identifier.issn | 0094-243X | en_US |
| dc.identifier.scopusquality | N/A | en_US |
| dc.identifier.uri | https://dx.doi.org/10.1063/1.4912608 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12395/31899 | |
| dc.identifier.volume | 1648 | en_US |
| dc.identifier.wos | WOS:000355339702026 | en_US |
| dc.identifier.wosquality | N/A | en_US |
| dc.indekslendigikaynak | Web of Science | en_US |
| dc.indekslendigikaynak | Scopus | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | AMER INST PHYSICS | en_US |
| dc.relation.ispartof | PROCEEDINGS OF THE INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2014 (ICNAAM-2014) | en_US |
| dc.relation.ispartofseries | AIP Conference Proceedings | |
| dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.selcuk | 20240510_oaig | en_US |
| dc.title | Bounds for the Distance Estrada Index of Graphs | en_US |
| dc.type | Conference Object | en_US |
