On the Maximum Estrada Index of 3-Uniform Linear Hypertrees

الملخص EN

For a simple hypergraph H on n vertices, its Estrada index is defined as E E ( H ) = ∑ i = 1 n e λ i , where λ 1 , λ 2 , … , λ n are the eigenvalues of its adjacency matrix.

In this paper, we determine the unique 3-uniform linear hypertree with the maximum Estrada index.