Bounds For The Distance Estrada Index Of Graphs
Abstract
The D-eigenvalues μ1,μ2,...,μn of a connected graph G are the eigenvalues of its distance matrix. The distance Estrada index of G is defined in [15] as DEE=DEE(G)=i=1n eμi In this paper, we give better lower bounds for the distance Estrada index of any connected graph as well as some relations between DEE(G) and the distance energy.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.