On Generalized Distance Gaussian Estrada Index of Graphs

Abdollah Alhevaz, Maryam Baghipur, Yilun Shang

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)
16 Downloads (Pure)

Abstract

For a simple undirected connected graph G of order n, let D(G) , DL(G) , DQ(G) and Tr(G) be, respectively, the distance matrix, the distance Laplacian matrix, the distance signless Laplacian matrix and the diagonal matrix of the vertex transmissions of G. The generalized distance matrix Dα(G) is signified by Dα(G)=αTr(G)+(1−α)D(G) , where α∈[0,1]. Here, we propose a new kind of Estrada index based on the Gaussianization of the generalized distance matrix of a graph. Let ∂1,∂2,…,∂n be the generalized distance eigenvalues of a graph G. We define the generalized distance Gaussian Estrada index Pα(G) , as Pα(G)=∑ni=1e−∂2i. Since characterization of Pα(G) is very appealing in quantum information theory, it is interesting to study the quantity Pα(G) and explore some properties like the bounds, the dependence on the graph topology G and the dependence on the parameter α . In this paper, we establish some bounds for the generalized distance Gaussian Estrada index Pα(G) of a connected graph G, involving the different graph parameters, including the order n, the Wiener index W(G) , the transmission degrees and the parameter α∈[0,1] , and characterize the extremal graphs attaining these bounds.
Original languageEnglish
Article number1276
Number of pages21
JournalSymmetry
Volume11
Issue number10
DOIs
Publication statusPublished - 11 Oct 2019

Fingerprint Dive into the research topics of 'On Generalized Distance Gaussian Estrada Index of Graphs'. Together they form a unique fingerprint.

Cite this