Distance Estrada index of random graphs

From MaRDI portal
Publication:2938352




Abstract: Let lambda1,lambda2,cdots,lambdan be the eigenvalues of the distance matrix of a connected graph G. The distance Estrada index of G is defined as DEE(G)=sumi=1nelambdai. In this note, we present new lower and upper bounds for DEE(G). In addition, a Nordhaus-Gaddum type inequality for DEE(G) is given.









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)