title: On the maximum Estrada index of 3-uniform linear hypertrees.
abstract: For a simple hypergraph H on n vertices, its Estrada index is defined as [Formula in text], 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.
authors.affiliation: School of Computer Science, Shaanxi Normal University, Xi'an 710062, China ; College of Computer, Qinghai Normal University, Xining 810008, China.
authors.forename: Faxu
authors.initials: F
authors.lastname: Li
authors.affiliation: Department of Mathematics, Qinghai Normal University, Xining 810008, China.
authors.forename: Liang
authors.initials: L
authors.lastname: Wei
authors.affiliation: Department of Mathematics, Southeast University, Nanjing 210096, China ; Department of Mathematics, Faculty of Science, King Abdulaziz University, Jeddah 21589, Saudi Arabia.
authors.forename: Jinde
authors.initials: J
authors.lastname: Cao
authors.affiliation: School of Computer Science, Shaanxi Normal University, Xi'an 710062, China ; College of Computer, Qinghai Normal University, Xining 810008, China.
authors.forename: Feng
authors.initials: F
authors.lastname: Hu
authors.affiliation: College of Computer, Qinghai Normal University, Xining 810008, China.
authors.forename: Haixing
authors.initials: H
authors.lastname: Zhao
mesh_terms: D006801:Humans; D008433:Mathematics; D015233:Models, Statistical