Distance Estrada index of random graphs

From MaRDI portal
Publication:2938352

DOI10.1080/03081087.2013.872640zbMATH Open1314.05056arXiv1511.06132OpenAlexW2015658971MaRDI QIDQ2938352FDOQ2938352


Authors: Yilun Shang Edit this on Wikidata


Publication date: 14 January 2015

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Abstract: Let lambda1,lambda2,cdots,lambdan be the eigenvalues of the distance matrix of a connected graph G. The distance Estrada index of G is defined as DEE(G)=sumi=1nelambdai. In this note, we present new lower and upper bounds for DEE(G). In addition, a Nordhaus-Gaddum type inequality for DEE(G) is given.


Full work available at URL: https://arxiv.org/abs/1511.06132




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Distance Estrada index of random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938352)