Distance Estrada index of random graphs
From MaRDI portal
Publication:2938352
DOI10.1080/03081087.2013.872640zbMATH Open1314.05056arXiv1511.06132OpenAlexW2015658971MaRDI QIDQ2938352FDOQ2938352
Authors: Yilun Shang
Publication date: 14 January 2015
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Abstract: Let be the eigenvalues of the distance matrix of a connected graph . The distance Estrada index of is defined as . In this note, we present new lower and upper bounds for . In addition, a Nordhaus-Gaddum type inequality for is given.
Full work available at URL: https://arxiv.org/abs/1511.06132
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Inequalities involving eigenvalues and eigenvectors (15A42) Distance in graphs (05C12)
Cites Work
Cited In (9)
- On the spectrum of linear dependence graph of a finite dimensional vector space
- On Distance Signless Laplacian Estrada Index and Energy of Graphs
- Further results on distance estrada index of random graphs
- Estimating the distance Estrada index
- The Laplacian energy and Laplacian Estrada index of random multipartite graphs
- On the distance Estrada index of graphs
- The distance Laplacian spectral radius of clique trees
- The many facets of the Estrada indices of graphs and networks
- On the distance signless Laplacian Estrada index of graphs
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)