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=1neλ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.
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/637865 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|