Bounds of distance Estrada index of graphs
Yilun Shang

TL;DR
This paper establishes new bounds and inequalities for the distance Estrada index of connected graphs, enhancing understanding of its extremal properties and relationships.
Contribution
It introduces novel lower and upper bounds for the distance Estrada index and a Nordhaus-Gaddum type inequality, expanding theoretical insights into graph spectral measures.
Findings
New lower bounds for $DEE(G)$
New upper bounds for $DEE(G)$
A Nordhaus-Gaddum type inequality for $DEE(G)$
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Matrix Theory and Algorithms · Synthesis and Properties of Aromatic Compounds
