Merging the Spectral Theories of Distance Estrada and Distance Signless Laplacian Estrada Indices of Graphs
Suppose that G is a simple undirected connected graph.Denote by D ( G ) the distance matrix of G and by T r ( G ) the diagonal matrix of the vertex transmissions in G, and let α ∈ [ 0 , 1 ].The generalized distance matrix D α ( G ) is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α