Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 637865, 7 pages
Research Article

On the Maximum Estrada Index of 3-Uniform Linear Hypertrees

1School of Computer Science, Shaanxi Normal University, Xi’an 710062, China
2College of Computer, Qinghai Normal University, Xining 810008, China
3Department of Mathematics, Qinghai Normal University, Xining 810008, China
4Department of Mathematics, Southeast University, Nanjing 210096, China
5Department of Mathematics, Faculty of Science, King Abdulaziz University, Jeddah 21589, Saudi Arabia

Received 3 July 2014; Accepted 12 August 2014; Published 28 August 2014

Academic Editor: Jianlong Qiu

Copyright © 2014 Faxu Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


For a simple hypergraph on vertices, its Estrada index is defined as , where are the eigenvalues of its adjacency matrix. In this paper, we determine the unique 3-uniform linear hypertree with the maximum Estrada index.