Bounds for the Distance Estrada Index of Graphs
No Thumbnail Available
Date
2015
Journal Title
Journal ISSN
Volume Title
Publisher
AMER INST PHYSICS
Access Rights
info:eu-repo/semantics/closedAccess
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.
Description
International Conference on Numerical Analysis and Applied Mathematics (ICNAAM) -- SEP 22-28, 2014 -- Rhodes, GREECE
Keywords
Journal or Series
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2014 (ICNAAM-2014)
WoS Q Value
N/A
Scopus Q Value
N/A
Volume
1648
