Cargando…
On the Maximum Estrada Index of 3-Uniform Linear Hypertrees
For a simple hypergraph H on n vertices, its Estrada index is defined as [Formula: see 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.
| Autores principales: | , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Hindawi Publishing Corporation
2014
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4164850/ https://www.ncbi.nlm.nih.gov/pubmed/25302329 http://dx.doi.org/10.1155/2014/637865 |