On the r-uniform linear hypertrees with extremal Estrada indices

Wen-Huan Wang and Yi-Sai Xue

Applied Mathematics and Computation, 2020, vol. 377, issue C

Abstract: Let H be a hypergraph with n vertices. The Estrada index of H is defined as the sum of eλ1,…,eλn, where λ1,…,λn are the eigenvalues of the adjacency matrix of H. Let Tn,r be the set of r-uniform linear hypertrees with n vertices and Tn,rΔ the subset of Tn,r in which each hypergraph has a largest vertex degree Δ, where r ≥ 3 and 2≤Δ≤(n−1)(r−1). Several new transformations for studying the Estrada indices of hypergraphs are introduced. By these transformations, the hypertree with the smallest Estrada index is determined in Tn,rΔ and the hypertrees with the smallest, the second smallest, the largest, and the second largest Estrada indices are derived among Tn,r.

Keywords: Estrada index; r-uniform hypergraph; Linear hypertree (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320301132
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:377:y:2020:i:c:s0096300320301132

DOI: 10.1016/j.amc.2020.125144

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().