Distance Estrada index of random graphs
From MaRDI portal
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.
Recommendations
Cites work
Cited in
(12)- Further results on distance estrada index of random graphs
- The many facets of the Estrada indices of graphs and networks
- The distance Laplacian spectral radius of clique trees
- Bounds of distance Estrada index of graphs.
- The Laplacian energy and Laplacian Estrada index of random multipartite graphs
- On the distance Estrada index of graphs
- On the spectrum of linear dependence graph of a finite dimensional vector space
- On Distance Signless Laplacian Estrada Index and Energy of Graphs
- Estimating the distance Estrada index
- On the distance signless Laplacian Estrada index of graphs
- Some bounds for distance signless Laplacian energy-like invariant of networks
- Degree-based topological indices of a general random chain
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)