On the Maximum Estrada Index of 3-Uniform Linear Hypertrees

On the Maximum Estrada Index of 3-Uniform Linear Hypertrees

For a simple hypergraph H on n vertices, its Estrada index is defined as EE(H)=∑i=1n‍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.

Bibliographic Details
Main Authors: Li, Faxu, Wei, Liang, Cao, Jinde, Hu, Feng, Zhao, Haixing
Format: Online
Language:English
Published: Hindawi Publishing Corporation 2014
Online Access:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4164850/

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4164850/

Similar Items